✦ LIBER ✦

A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing

✍ Scribed by Ghaith Rabadi; Georgios C. Anagnostopoulos; Mansooreh Mollaghasemi

Publisher: Springer
Year: 2006
Tongue: English
Weight: 248 KB
Volume: 32
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-005-0333-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound and heuristic algorit

A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem

✍ Wen-Chiung Lee; Yu Shin Lin; Chin-Chia Wu 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 151 KB

Algorithms for the single machine total

Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

✍ Fuh-Der Chou; Hui-Mei Wang; Tzu-Yun Chang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 275 KB

A tabu search heuristic for the multipro

A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times

✍ Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 961 KB

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times and delivery times

✍ Eugeniusz Nowicki; Czesław Smutnicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 679 KB

A hybrid simulated annealing approach fo

A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions

✍ John Mittenthal; Madabhushi Raghavachari; Arif I. Rana 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 853 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