Journal ArticleDOI
An Adaptable Scheduling Algorithm for Flexible Flow Lines
TLDR
An algorithm that schedules the loading of parts into a manufacturing line to minimize the makespan and secondarily to minimize queueing is presented.Abstract:
Consider a manufacturing line that produces parts of several types. Each part must be processed by at most one machine in each of several banks of machines. This paper presents an algorithm that schedules the loading of parts into such a line. The objective is primarily to minimize the makespan and secondarily to minimize queueing. The problem is decomposed into three subproblems and each of these is solved using a fast heuristic. The most challenging subproblem is that of finding a good loading sequence, and this is addressed using workload concepts and an approximation to dynamic programming. We make several extensions to the algorithm in order to handle limited storage capacity, expediting, and reactions to system dynamics. The algorithm was tested by computing schedules for a real production line, and the results are discussed.read more
Citations
More filters
Journal ArticleDOI
The hybrid flow shop scheduling problem
TL;DR: A literature review on exact, heuristic and metaheuristic methods that have been proposed for the solution of the hybrid flow shop problem is presented.
Journal ArticleDOI
Hybrid flow shop scheduling: a survey
Richard J. Linn,Wei Zhang +1 more
TL;DR: The state of art in hybrid flow shop scheduling is reviewed and suggestions for future research directions are suggested.
Journal ArticleDOI
Hybrid flow shop scheduling considering machine electricity consumption cost
TL;DR: The results from computational experiments indicate that the efficiency and effectiveness of the proposed MOACO are comparable to NSGA-II and SPEA2 and shows that durations of TOU periods and processing speed of machines have great influence on scheduling results as longer off-peak period and use of faster machines provide more flexibility for shifting high-energy operations to off- peak periods.
Journal ArticleDOI
Scheduling flexible flow lines with sequence dependent setup times
Mary E. Kurz,Ronald G. Askin +1 more
TL;DR: This paper examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan, and finds an application of the Random Keys Genetic Algorithm to be very effective for the problems examined.
Journal ArticleDOI
An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
TL;DR: An immune algorithm approach to the scheduling of a SDST hybrid flow shop is described and it was established that IA outperformed RKGA.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
An Evaluation of Flow Shop Sequencing Heuristics
TL;DR: Three previously unreported heuristics are included in the study, one of which turns out to be superior to the other ten heuristic tested and is presented in this paper.
Book ChapterDOI
Recent Developments in Deterministic Sequencing and Scheduling: A Survey
TL;DR: A survey of deterministic sequencing and scheduling can be found in this article, where the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory.