Unrelated parallel machines scheduling with dependent setup times in textile industry

The problem tackled in this paper is an unrelated parallel machines scheduling problem with machine and sequence dependent setup times, machine eligibility and different resource types constraints. This subject is inspired from a textile industry partner case. The different characteristics of this p...

Full description

Saved in:
Bibliographic Details
Published inComputers & industrial engineering Vol. 174; p. 108736
Main Authors Berthier, A., Yalaoui, A., Chehade, H., Yalaoui, F., Amodeo, L., Bouillot, C.
Format Journal Article
LanguageEnglish
Published Elsevier 01.12.2022
Subjects
Computer Science
Parallel machines
Scheduling
Mathematical model
Genetic algorithm
Optimization
Setup times
Online AccessGet full text

Cover

More Information
Summary:The problem tackled in this paper is an unrelated parallel machines scheduling problem with machine and sequence dependent setup times, machine eligibility and different resource types constraints. This subject is inspired from a textile industry partner case. The different characteristics of this problem have never been combined as it is depicted in this paper. Two resolution methods are exposed. A new mathematical programming is proposed to have an exact resolution approach of this complex problem. An improved genetic algorithm (GA) with dedicated operators is also presented in order to solve the industrial case in a reasonable computational time.
ISSN:0360-8352
DOI:10.1016/j.cie.2022.108736