✦ LIBER ✦

Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints

✍ Scribed by Francis Sourd

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 179 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.06.005

No coin nor oath required. For personal study only.

✦ Synopsis

A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also present experimental results.

📜 SIMILAR VOLUMES

Common due date scheduling problem with

Common due date scheduling problem with separate earliness and tardiness penalties

✍ Parthasarati Dileepan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Parallel genetic algorithms for the earl

Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights

✍ Chae Y. Lee; Seok J. Kim 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Heuristics for multimachine minmax sched

Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

✍ Awi Federgruen; Gur Mosheiov 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

Minimizing the weighted number of tardy

Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

✍ B.M.T. Lin; T.C.E. Cheng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Greedy heuristics for single-machine sch

Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

✍ Awi Federgruen; Gur Mosheiov 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Sequencing and due-date determination in

Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs

✍ Soroush H.M. 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

This paper studies the problem of simultaneous due-date determination and sequencing of a set of n jobs on a single machine where processing times are random variables and job earliness and tardiness costs are distinct. The objective is to determine the optimal sequence and the optimal due-dates whi