✦ LIBER ✦

On the parametric complexity of schedules to minimize tardy tasks

✍ Scribed by Michael R. Fellows; Catherine McCartin

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 121 KB
Volume: 298
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00811-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of coupled-task schedu

On the complexity of coupled-task scheduling

✍ A.J. Orman; C.N. Potts 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 873 KB

Single machine scheduling to minimize th

Single machine scheduling to minimize the number of early and tardy jobs

✍ Avital Lann; Gur Mosheiov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 913 KB

Single-machine scheduling to minimize th

Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs

✍ Chung-Lun Li; T.C.E. Cheng; Z.-L. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 866 KB

Scheduling on a single machine with a si

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

✍ I. Adiri; E. Frostig; A. H. G. Rinnooy Kan 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 2 views

Quay crane scheduling at container termi

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

✍ Jiyin Liu; Yat-wah Wan; Lei Wang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

Scheduling with two job classes and setu

Scheduling with two job classes and setup times to minimize the number of tardy jobs

✍ Jatinder N.D. Gupta; Johnny C. Ho 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 969 KB

This paper considers the problem of minimizing the number of tardy jobs to be processed on a single machine with two job classes where a job's setup time depends on its job class. This is an increasinbly important problem due to the growing popularity of group technology manufacturing techniques, wh