✦ LIBER ✦

A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

✍ Scribed by Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 651 KB
Volume: 21
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(94)90053-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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