Dispatching in flowshops with bottleneck machines

Authors:
Chandrasekharan Rajendran;Knut Alicke
Affiliations:
Department of Management Studies, Indian Institute of Technology Madras, Chennai 600 036, India;Institute for Material Flow and Logistics, Department of Mechanical Engineering, University of Karlsruhe, D-76128 Karlsruhe, Germany
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 2
Cited 6

The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research
Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell

Computers and Industrial Engineering

Hybrid approach using ant colony optimization and fuzzy logic to solve multi-criteria hybrid flow shop scheduling problem

CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Computers and Operations Research
A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop

Engineering Applications of Artificial Intelligence
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

Computers and Operations Research
Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA

Engineering Applications of Artificial Intelligence
An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of dispatching in flowshops with bottleneck machines. The presence of bottleneck machines results in the restricted throughput in flowshops. The objective is to develop dispatching rules for scheduling by taking into account the presence of bottleneck machines. The measures of performance are the minimization of total flowtime of jobs, the minimization of the sum of earliness and tardiness of jobs, and the minimization of total tardiness of jobs, considered separately. Many existing conventional dispatching rules and the proposed dispatching rules have been extensively investigated for their performance by generating a large number of problems of various sizes and bottleneck conditions. The results of the experimental investigation show that the proposed dispatching rules emerge to be superior to the conventional dispatching rules.