𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Job shop scheduling with unit time operations under resource constraints and release dates

✍ Scribed by Jayme Luiz Szwarcfiter

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
378 KB
Volume
18
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial-time algorithm for the two-
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
✍ Vadim G. Timkovsky πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 1014 KB

We consider a polynomial-time algorithm for the following scheduling problem: Given two machines, where each machine can process at most one job at a time; a set of jobs, where each job can start on or after its release date and consists of a chain of unit-time operations such that the machines have

Scheduling with job release dates, deliv
Scheduling with job release dates, delivery times and preemption penalties
✍ Zhaohui Liu; T.C.Edwin Cheng πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 73 KB

We consider in this paper the single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties, where each time a job is started, whether initially or after preemption, a job-dependent setup must take place. First, we prove that the problem is strongly NP-

Open shop problem with zero-one time ope
Open shop problem with zero-one time operations and integer release date/deadline intervals
✍ Marek Kubale πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 744 KB

We study the problem of constructing a minimum makespan schedule for the n-job m-machine open shop with zero-one time operations and integer release dates and deadlines. The general scheduling problem is shown to be NP-complete. Two polynomial-time algorithms are given for the following special case