A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Authors:
Chun-Lung Chen;Chuen-Lung Chen
Affiliations:
Department of Accounting Information, Takming University of Science and Technology, No. 56, Sec. 1, Huanshan Rd., Neihu District, Taipei City, Taiwan 11451, ROC;Department of MIS, National Chengchi University, ZhiNan Rd., Wenshan District, Taipei City, Taiwan 11605, ROC
Venue:
Computers and Operations Research
Year:
2009

Citing 11
Cited 2

An adaptable scheduling algorithm for flexible flow lines

Operations Research
BPSS: a scheduling support system for the packaging industry

Operations Research
An evaluation of sequencing heuristics in flow shops with multiple processors

Computers and Industrial Engineering
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Scheduling of drilling operations in printed circuit board factory

Computers and Industrial Engineering
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Computers and Operations Research
Dispatching in flowshops with bottleneck machines

Computers and Industrial Engineering
A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines

Computers and Operations Research
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers

Mathematical and Computer Modelling: An International Journal

A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint

Computers and Industrial Engineering
Minimizing resource consumption on uniform parallel machines with a bound on makespan

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This study developed a bottleneck-based heuristic (BBFFL) to solve a flexible flow line problem with a bottleneck stage, where unrelated parallel machines exist in all the stages, with the objective of minimizing the makespan. The essential idea of BBFFL is that scheduling jobs at the bottleneck stage may affect the performance of a heuristic for scheduling jobs in all the stages. Therefore, in BBFFL, a variant of Johnson's rule is used to develop a bottleneck-based initial sequence generator (BBISG). Then, a bottleneck-based multiple insertion procedure (BBMIP) is applied to the initial sequence to control the order by which jobs enter the bottleneck stage to be the same as that at the first stage. Five experimental factors were used to design 243 different production scenarios and 10 test problems were randomly generated in each scenario. These test problems were used to compare the performance of BBFFL with several well-known heuristics. Computational results show that the BBFFL significantly outperforms all the well-known heuristics.