New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
محورهای موضوعی : Mathematical Optimization
Hamidreza Kia
1
(Department of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnics), 424 Hafez Avenue, Tehran, 15916-34311, Iran)
Seyed Hassan Ghodsypour
2
(Department of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnics), 424 Hafez Avenue, Tehran, 15916-34311, Iran)
Hamid Davoudpour
3
(Department of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnics), 424 Hafez Avenue, Tehran, 15916-34311, Iran)
کلید واژه: Scheduling . Dynamic flexible flow line . Simulation . Heuristics . Genetic programming,
چکیده مقاله :
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0–1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.
