Title: A single machine scheduling problem with time windows and precedence constraints
Authors: Davari, Morteza ×
Talla Nobibon, Fabrice
Leus, Roel
Demeulemeester, Erik #
Issue Date: 2013
Conference: EURO-INFORMS European Conference on Operational Research edition:26 location:Rome (Italy) date:1-4 July 2013
Abstract: This paper studies a scheduling problem in a single-machine environment. Each job has a processing time, a release date, a due date, a deadline and a weight representing the penalty per unit-time delay. Moreover, an acyclic graph representing the jobs’ precedence relations is given so that each job is executed after all completion times of its predecessors. Our goal is to schedule jobs to minimize the total weighted tardiness penalty. We present a branch and bound algorithm as well as an enhanced successive sublimation dynamic programming algorithm to solve the problem until optimality.
Publication status: published
KU Leuven publication type: IMa
Appears in Collections:Research Center for Operations Management, Leuven
Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.


All items in Lirias are protected by copyright, with all rights reserved.