Professional article
English

Metaheuristics for a scheduling problem with rejection and tardiness penalties

Published in

Journal of scheduling, vol. 18, no. 1, p. 89-105

Publication date

2015

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

  • Scheduling
  • Metaheuristics
  • Order acceptance
  • Setups

Citation (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. doi: 10.1007/s10951-014-0395-8

Main files (1)

Article (Accepted version)

Identifiers

Journal ISSN

1094-6136
649views
0downloads

Technical informations

Creation

08/06/2015 20:08:00

First validation

08/06/2015 20:08:00

Update

14/03/2023 23:22:57

Status update

14/03/2023 23:22:57

Last indexation

31/10/2024 00:30:18
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated