✦ LIBER ✦

Single machine batch scheduling to minimize the weighted number of late jobs

✍ Scribed by Peter Brucker; Mikhail Y. Kovalyov

Publisher: Springer
Year: 1996
Tongue: English
Weight: 419 KB
Volume: 43
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01303431

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 late jobs under uncertainty

✍ Shao Chin Sung; Milan Vlach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 227 KB

In this paper, we deal with the problem of sequencing a ÿnite number of jobs for processing by a single machine with the objective of minimizing the number of jobs that are not completed by their due dates. We propose a rather general model based on an algebraic approach. By specifying suitable bina

Scheduling Equal Processing Time Jobs to

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

✍ Peter Brucker; Svetlana A. Kravchenko 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 705 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 jobs with release times preem

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB

Using Lagrangean relaxation to minimize

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

✍ Stéphane Dauzère-Pérès; Marc Sevaux 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Scheduling unit time open shops to minim

Scheduling unit time open shops to minimize the weighted number of late jobs

✍ Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB