UNIGE document Professional Article
previous document  unige:73267  next document
add to browser collection

Metaheuristics for a scheduling problem with rejection and tardiness penalties

Widmer, Marino
Published in Journal of Scheduling. 2015, vol. 18, no. 1, p. 89-105
Abstract In this paper, we consider a single-machine scheduling problem (P) inspired from manufacturing instances. A release date, a deadline, and a regular (i.e., non-decreasing) cost function are associated with each job. The problem takes into account sequence-dependent setup times and setup costs between jobs of different families. Moreover, the company has the possibility to reject some jobs/orders, in which case a penalty (abandon cost) is incurred. Therefore, the problem at hand can be viewed as an order acceptance and scheduling problem. Order acceptance problems have gained interest among the research community over the last decades, particularly in a make-to-order environment. We propose and compare a constructive heuristic, local search methods, and population-based algorithms. Tests are performed on realistic instances and show that the developed metaheuristics significantly outperform the currently available resolution methods for the same problem.
Keywords SchedulingMetaheuristicsOrder acceptanceSetups
Full text
(ISO format)
THEVENIN, Simon, WIDMER, Marino, ZUFFEREY, Nicolas. Metaheuristics for a scheduling problem with rejection and tardiness penalties. In: Journal of Scheduling, 2015, vol. 18, n° 1, p. 89-105. https://archive-ouverte.unige.ch/unige:73267

220 hits

0 download


Deposited on : 2015-06-22

Export document
Format :
Citation style :