Journal ArticleDOI
A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
Rubén Ruiz,Concepción Maroto +1 more
Reads0
Chats0
TLDR
This paper aims to provide a metaheuristic, in the form of a genetic algorithm, to a complex generalized flowshop scheduling problem that results from the addition of unrelated parallel machines at each stage, sequence dependent setup times and machine eligibility.About:
This article is published in European Journal of Operational Research.The article was published on 2006-03-16. It has received 388 citations till now. The article focuses on the topics: Flow shop scheduling & Job shop scheduling.read more
Citations
More filters
Journal ArticleDOI
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
Journal ArticleDOI
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more
TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.
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
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
TL;DR: An extensive review of recently published papers on hybrid flow shop (HFS) scheduling problems is presented and the papers are classified first according to the HFS characteristics and production limitations considered in the respective papers and then according toThe solution approach proposed.
Journal ArticleDOI
Scheduling and lot sizing with sequence-dependent setup: A literature review
Xiaoyan Zhu,Wilbert E. Wilhelm +1 more
TL;DR: A review of the literature related to the class of scheduling problems that involve sequence-dependent setup times (costs), an important consideration in many practical applications, can be found in this paper.
References
More filters
Book
Genetic Algorithms + Data Structures = Evolution Programs
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Journal ArticleDOI
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Journal ArticleDOI
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Journal ArticleDOI
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more
TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.
Journal ArticleDOI
A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
TL;DR: A simple algorithm for the solution of very large sequence problems without the use of a computer that produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time.