✦ LIBER ✦

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

✍ Scribed by T.C.E. Cheng; C.T. Ng; J.J. Yuan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling to minimize th

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

Multi-agent scheduling on a single machi

✍ T.C.E. Cheng; C.T. Ng; J.J. Yuan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Single-machine scheduling to minimize th

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

An Exact Method to Minimize the Number o

✍ Stéphane Dauzère-Pérès; Marc Sevaux 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 141 KB

Scheduling on a single machine with a si

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

Scheduling jobs with release times preem

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