A mixed integer programming approach for the single machine problem with unequal release dates

• Published in: Computers & operations research Vol. 51; pp. 323 - 330
• Main Authors: Kooli, Anis, Serairi, Mehdi
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier Ltd 01.11.2014; Elsevier; Pergamon Press Inc
• Subjects: Algorithms; Applied sciences; Computer Science; Computer simulation; Exact sciences and technology; Integer programming; Inventory control, production control. Distribution; Linear programming; Mathematical problems; Mathematical programming; Mixed integer programming; Operational research and scientific management; Operational research. Management science; Operations Research; Preprocessing; Production scheduling; Release dates; Scheduling algorithms; Scheduling, sequencing; Studies; Valid inequalities; Mixed integer programming; Valid inequalities; Preprocessing; Release dates; Performance evaluation; Computer simulation; Branch and bound method; Scheduling; Makespan; Implicit enumeration method; NP hard problem; Single machine; Inequality
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2014.06.013

In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing procedure together with the consideration of valid inequalities. A computer simulation to measure the performance of the algorithm shows that our proposed method outperforms state-of-the-art branch-and-bound algorithms.