✦ LIBER ✦

Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach

✍ Scribed by E. Nowicki and S. Zdrzalka

Book ID: 125580099
Publisher: Palgrave Publishers Ltd.
Year: 1996
Tongue: English
Weight: 318 KB
Volume: 47
Category: Article
ISSN: 0160-5682
DOI: 10.2307/3010413

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling parallel machines with major

Scheduling parallel machines with major and minor setup times

✍ Wittrock, RobertJ. 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 706 KB

This article discusses the problem of scheduling a large set of parts on an FMS so as to minimize the total completion time. Here, the FMS consists of a set of parallel identical machines. Setup time is incurred whenever a machine switches from one type of part to another. The setup time may be larg

Multiple machine JIT scheduling: a tabu

Multiple machine JIT scheduling: a tabu search approach

✍ Finke, Daniel; Medeiros, D. J.; Traband, Mark 📂 Article 📅 2007 🏛 Taylor and Francis Group 🌐 English ⚖ 225 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

A Tabu Search Algorithm for Single Machi

A Tabu Search Algorithm for Single Machine Scheduling with Release Times, Due Dates, and Sequence-Dependent Set-up Times

✍ H. J. Shin; C.-O. Kim; S. S. Kim 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 126 KB

Single-machine bicriterion group schedul

Single-machine bicriterion group scheduling with deteriorating setup times and job processing times

✍ Wang, Jian-Jun; Liu, Ya-Jing 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Lateness minimization with Tabu search f

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

✍ Miguel A. González, Camino R. Vela… 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 438 KB