✦ LIBER ✦

On the complexity of generalized due date scheduling problems

✍ Scribed by Nicholas G. Hall; Suresh P. Sethi; Chelliah Sriskandarajah

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 700 KB
Volume: 51
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(91)90149-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the generalized due dates sche

A note on the generalized due dates scheduling problems

✍ C. Sriskandarajah 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 487 KB 👁 2 views

On the complexity of preemptive openshop

On the complexity of preemptive openshop scheduling problems

✍ C. Sriskandarajah; E. Wagneur 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

The weighted common due date single mach

The weighted common due date single machine scheduling problem revisited

✍ Wlodzimierz Szwarc 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 509 KB

The complexity of cyclic shop scheduling

The complexity of cyclic shop scheduling problems

✍ Nicholas G. Hall; Tae-Eog Lee; Marc E. Posner 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 190 KB

We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol

The complexity of two group scheduling p

The complexity of two group scheduling problems

✍ Jacek Blazewicz; Mikhail Y. Kovalyov 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 94 KB

The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem

The NP-completeness of the n/m/parallel/

The NP-completeness of the n/m/parallel/Cmax preemptive due-date scheduling problem

✍ T.C.E. Cheng; C.C.S. Sin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 154 KB

We present a proof of the NP-completeness of the problem to schedule n simultaneously available jobs on m parallel machines to minimize the maximum job completion time subject to no jobs being tardy.