Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study
Authors:
- 1 October 2004
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 42 (19) , 4015-4030
Abstract
The flow shop with multiple processors (FSMP) environment is relatively common and has a variety of applications. The majority of academic authors solve the scheduling problem of FSMP using deterministic data that ignore the stochastic nature of a real-world problem. Discrete-event simulation can model a non-linear and stochastic problem and allows examination of the likely behaviour of a proposed manufacturing system under selected conditions. However, it does not provide a method for optimization. The present paper proposes to solve the FSMP scheduling problem by using a tabu-search simulation optimization approach. It features both the stochastically modelling capability of the discrete-event simulation and the efficient local-search algorithm of tabu search. A case study from a multilayer ceramic capacitor manufacturing illustrates the proposed solution methodology. Empirical results show promise for the practical application of the proposed methodologies. Future research opportunities are then addressed.Keywords
This publication has 26 references indexed in Scilit:
- Design and implementation of a course scheduling system using Tabu SearchEuropean Journal of Operational Research, 2002
- Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum latenessInternational Journal of Production Economics, 2000
- A two-stage methodology for short-term batch plant schedulingComputers & Chemical Engineering, 1998
- A tabu search approach for the flow shop scheduling problemEuropean Journal of Operational Research, 1998
- Comparison of iterative improvement techniques for schedule optimizationEuropean Journal of Operational Research, 1996
- Genetic algorithms and tabu search: Hybrids for optimizationComputers & Operations Research, 1995
- Job scheduling in petrochemical production: Two-stage processing with finite intermediate storageComputers & Chemical Engineering, 1994
- SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCHIIE Transactions, 1993
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970