✦ LIBER ✦

A heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling

✍ Scribed by Gursel A. Suer; Zbigniew Czajkiewicz

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 299 KB
Volume: 23
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(92)90084-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Minimizing the number of tardy jobs in i

Minimizing the number of tardy jobs in identical machine scheduling

✍ Gürsel A. Süer; Eduardo Báez; Zbigniew Czajkiewicz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 285 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

Minimizing the number of tardy jobs in s

Minimizing the number of tardy jobs in single machine sequencing

✍ Ahmad H. Sharary; Nejib Zaguia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P, <). In a feasible schedule a job is called a tardy j

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

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