✦ LIBER ✦

Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

✍ Scribed by T. C. E. Cheng and Z.-L. Chen

Book ID: 121223937
Publisher: Palgrave Publishers Ltd.
Year: 1994
Tongue: English
Weight: 270 KB
Volume: 45
Category: Article
ISSN: 0160-5682
DOI: 10.2307/2584459

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel machine scheduling with earline

Parallel machine scheduling with earliness-tardiness penalties and space limits

✍ Suk Jae Jeong; Kyung Sup Kim 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 205 KB

Scheduling with earliness–tardiness pena

Scheduling with earliness–tardiness penalties and parallel machines

✍ Yasmin A. Rios-Solis 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 84 KB

Efficient algorithms for machine schedul

Efficient algorithms for machine scheduling problems with earliness and tardiness penalties

✍ Guang Feng; Hoong Chuin Lau 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 393 KB

Scheduling with earliness and tardiness

Scheduling with earliness and tardiness penalties

✍ Michael C. Ferris; Milan Vlach 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

Single-machine scheduling with time wind

Single-machine scheduling with time windows and earliness/tardiness penalties

✍ Christos Koulamas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Adjacent orderings in single-machine sch

Adjacent orderings in single-machine scheduling with earliness and tardiness penalties

✍ Wlodzimierz Szwarc 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB

This article deals with a single-machine n job earliness-tardiness model with jobindependent penalties. It demonstrates that the arrangement of adjacent jobs in an optimal schedule depends on a critical value of the start times. Based on these precedence relations, the article develops criteria unde