✦ LIBER ✦

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

✍ Scribed by Ali Allahverdi; Harun Aydilek

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 870 KB
Volume: 60
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-machine proportionate flowshop sched

Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

✍ Ali Allahverdi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Fast algorithms to minimize the makespan

Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times

✍ Jinliang Cheng; George Steiner; Paul Stephenson 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 186 KB 👁 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniÿed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound

A heuristic for parallel machine schedul

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

✍ Chung-Lun Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 418 KB