Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints

Authors:
F. Jabbarizadeh;M. Zandieh;D. Talebi
Affiliations:
Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran;Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 3
Cited 3

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine

Computers in Industry - Special issue: Application of genetics algorithms in industry
Considering scheduling and preventive maintenance in the flowshop sequencing problem

Computers and Operations Research

The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches

Applied Soft Computing
Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation

Expert Systems with Applications: An International Journal
Production capacity planning and scheduling in a no-wait environment with controllable processing times: An integrated modeling approach

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

One of the common assumptions in the field of scheduling is that machines are always available in the planning horizon. This may not be true in realistic problems since machines might be busy processing some jobs left from previous production horizon, breakdowns or preventive maintenance activities. Another common assumption is the consideration of setup times as a part of processing times, while in some industries, such as printed circuit board and automobile manufacturing, not only setups are an important factor but also setup magnitude of a job depends on its immediately preceding job on the same machine, known as sequence-dependent setup times. In this paper, we consider hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints caused by preventive maintenance. The optimization criterion is the minimization of makespan. Since this problem is NP-hard in the strong sense, we propose three heuristics, based on SPT, LPT and Johnson rule and two metaheuristics based on genetic algorithm and simulated annealing. Computational experiments are performed to evaluate the efficiencies of the algorithms.