A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance

Krim, Hanane; Benmansour, Rachid; Duvivier, David; Artiba, Abdelhakim

doi:10.1051/ro/2018055

Cited by 8 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(2018, 2019), Huo and Zhao (2018), Kaabi (2019), Krim et al. (2019a, 2019b, 2020), Luo and Liu (2017), Najat et al. (2019), Shen and Zhu (2018), Touat et al.…”

Section: Introductionmentioning

confidence: 99%

Scheduling with day shifts and breaks

2020

Int Trans Operational Res

View full text Add to dashboard Cite

Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor-intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines and in the paintspraying stage of wooden furniture, we consider a scheduling problem with day shifts and breaks. We transform the problem into a new bin-packing problem and present some theoretical analyses. To meet the needs of practical applications, we propose a binary integer programming (BIP) formulation and a hybrid genetic algorithm (HGA) that is based on five heuristic algorithms and two postoptimization procedures. Computational results indicate that the BIP formulation is suitable for some data sets while the HGA is the most promising in that it saves about 37% of day shifts compared to the best of the five heuristic algorithms in the context of scheduling.

show abstract

“…(2018, 2019), Huo and Zhao (2018), Kaabi (2019), Krim et al. (2019a, 2019b, 2020), Luo and Liu (2017), Najat et al. (2019), Shen and Zhu (2018), Touat et al.…”

Section: Introductionmentioning

confidence: 99%