Heuristics for hybrid flow shops with controllable processing times and assignable due dates

Authors:
Jatinder N. D. Gupta;Karin Krüger;Volker Lauff;Frank Werner;Yuri N. Sotskov
Affiliations:
Department of Management, Ball State University, Muncie, IN;Otto-von-Guericke-Universität, Fakultät für Mathematik, PSF 4120, 39016 Magdeburg, Germany;Otto-von-Guericke-Universität, Fakultät für Mathematik, PSF 4120, 39016 Magdeburg, Germany;Otto-von-Guericke-Universität, Fakultät f¨r Mathematik, PSF 4120, 39016 Magdeburg, Germany;Institute of Engineering Cybernetics, Surganov St. 6, 220012 Minsk, Belarus
Venue:
Computers and Operations Research
Year:
2002

Citing 1
Cited 11

Sequencing with earliness and tardiness penalties: a review

Operations Research

A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

Computers and Operations Research
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem

Proceedings of the 9th annual conference on Genetic and evolutionary computation
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

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 hybrid flowshop with parallel batching machines and compatibilities

Computers and Operations Research
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

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

Engineering Applications of Artificial Intelligence
Scheduling jobs in flowshops with the introduction of additional machines in the future

Expert Systems with Applications: An International Journal
A two-stage hybrid flowshop scheduling problem in machine breakdown condition

Journal of Intelligent Manufacturing
meSO: simulation optimization using a multicriteria process capability index and evolutionary algorithms

Simulation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a generalization of the permutation flow shop problem that combines the scheduling function with the planning stage. In this problem, each work center consists of parallel identical machines. Each job has a different release date and consists of ordered operations that have to be processed on machines from different machine centers in the same order. In addition, the processing times of the operations on some machines may vary between a minimum and a maximum value depending on the use of a continuously divisible resource. We consider a nonregular optimization criterion based on due dates which are not a priori given but can be fixed by a decision-maker. A due date assignment cost is included into the objective function. For this type of problems, we generalize well-known approaches for the heuristic solution of classical problems and propose constructive algorithms based on job insertion techniques and iterative algorithms based on local search. For the latter, we deal with the design of appropriate neighborhoods to find better quality solution. Computational results for problems with up to 20 jobs and 10 machine centers are given.