✦ LIBER ✦

Minimizing the number of tardy jobs in identical machine scheduling

✍ Scribed by Gürsel A. Süer; Eduardo Báez; Zbigniew Czajkiewicz

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 285 KB
Volume: 25
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(93)90266-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 with batching: minimizing the

Scheduling with batching: minimizing the weighted number of tardy jobs

✍ Dorit S. Hochbaum; Dan Landy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 521 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

A heuristic procedure to minimize number

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

✍ Gursel A. Suer; Zbigniew Czajkiewicz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 299 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 for

Minimizing the number of tardy jobs for m parallel machines

✍ Johnny C. Ho; Yih-Long Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 794 KB