Optimizing blocking flow shop scheduling problem with total completion time criterion

Authors:
Ghasem Moslehi;Danial Khorasanian
Affiliations:
Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran;Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran
Venue:
Computers and Operations Research
Year:
2013

Citing 5
Cited 0

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

Computers and Operations Research
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms

Expert Systems with Applications: An International Journal
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

Computers and Industrial Engineering
A three-phase algorithm for flowshop scheduling with blocking to minimize makespan

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The blocking flow shop scheduling problem has found many applications in manufacturing systems. There are a few exact methods for solving this problem with different criteria. In this paper, efforts will be made to optimize the total completion time criterion for this problem. We present two mixed binary integer programming models, one of which is based on the departure times of jobs from machines, and the other is based on the idle and blocking times of jobs. An initial upper bound generator and some lower bounds and dominance rules are also developed to be used in a branch and bound algorithm. The algorithm solves 17 instances of the Taillard's benchmark problem set in less than 20min.