A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Economics Year : 2006

A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times

(1) , (1) , (1) , (1)
1

Abstract

In this study, we consider the problem of scheduling a set of independent jobs with sequence-dependent setup times and job splitting, on a set of identical parallel machines such that maximum completion time (makespan) is minimized. For this NP-hard problem, we suggest a heuristic algorithm improving an existing one, using a linear programming modeling with setup times and job splitting considerations. The performance of our new method is tested on over 6000 instances with different size by comparing it with a lower bound.

Dates and versions

hal-02477208 , version 1 (13-02-2020)

Identifiers

Cite

Djamel Nait Tahar, Farouk Yalaoui, Chengbin Chu, Lionel Amodeo. A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times. International Journal of Production Economics, 2006, 99 (1-2), pp.63-73. ⟨10.1016/j.ijpe.2004.12.007⟩. ⟨hal-02477208⟩

Collections

CNRS UTT LOSI
35 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More