✦ LIBER ✦

A moving block heuristic for minimizing earliness and tardiness on a single machine with unrestrictive common due dates

✍ Scribed by Scott J. Mason; Song Jin; Jagadish Jampani

Publisher: Society of Manufacturing Engineers
Year: 2005
Tongue: English
Weight: 1013 KB
Volume: 24
Category: Article
ISSN: 0278-6125
DOI: 10.1016/s0278-6125(05)80017-2

No coin nor oath required. For personal study only.

✦ Synopsis

A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments. The MBH is described for the single-machine environment under unrestrictive job due date conditions. The proposed MBH, which has polynomial computational complexity, outperforms previous heuristic solution approaches for 16 reference single-machine problems from the open literature. Experimental design results confirm the efficacy of the MBH over a wide range of single-machine earliness-tardiness problem instances.

📜 SIMILAR VOLUMES

Single-machine earliness-tardiness sched

Single-machine earliness-tardiness scheduling about a common due date with tolerances

✍ Michael X. Weng; Jose A. Ventura 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 823 KB

A note on the complexity of single-machi

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

✍ Jinjiang Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 119 KB

A note on minimizing the weighted sum of

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

✍ Bahram Alidaee; Irinel Dragan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Minimizing absolute and squared deviatio

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

✍ Uttarayan Bagchi; Yih-Long Chang; Robert S. Sullivan 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

A note on “Beam search heuristics for th

A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”

✍ F. Della Croce; E. Desmier; T. Garaix 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard

Sequencing jobs on a single machine with

Sequencing jobs on a single machine with a common due date and stochastic processing times

✍ Subhash C. Sarin; Erdal Erel; George Steiner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 561 KB