UNIGE document Chapitre d'actes
previous document  unige:73316  next document
add to browser collection
Title

Tabu search for a single machine scheduling problem with rejected jobs, setups and deadlines

Authors
Widmer, Marino
Published in Proceedings of the 9th International Conference of Modeling, Optimization and Simulation: "Performance, interoperability and safety for sustainable development" - MOSIM'12. Bordeaux (France) - 6-8 June 2012 - . 2012, p. 9
Abstract This paper addresses a single machine scheduling problem with release dates, deadlines, setup costs and times, and the possibility to reject some jobs while encountering an abandon cost. The objective function to minimize is a sum of regular functions depending on the completion time of the jobs. The problem is inspired by a manufacturing scheduling problem. We design a greedy algorithm and a tabu search approach for the problem. We studied several restriction procedures. Realistic instances with up to 500 jobs are tackled.
Keywords Tabu searchSingle machine scheduling
Full text
Structures
Citation
(ISO format)
ZUFFEREY, Nicolas, THEVENIN, Simon, WIDMER, Marino. Tabu search for a single machine scheduling problem with rejected jobs, setups and deadlines. In: Proceedings of the 9th International Conference of Modeling, Optimization and Simulation: "Performance, interoperability and safety for sustainable development" - MOSIM'12. Bordeaux (France). [s.l.] : [s.n.], 2012. p. 9. https://archive-ouverte.unige.ch/unige:73316

171 hits

0 download

Update

Deposited on : 2015-06-23

Export document
Format :
Citation style :