Journal ArticleDOI
An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
Rubén Ruiz,Thomas Stützle +1 more
Reads0
Chats0
TLDR
Two new IG algorithms are proposed for a complex flowshop problem that results from the consideration of sequence dependent setup times on machines, a characteristic that is often found in industrial settings.About:
This article is published in European Journal of Operational Research.The article was published on 2008-06-16. It has received 367 citations till now. The article focuses on the topics: Job shop scheduling & Greedy algorithm.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
Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption
TL;DR: This paper develops a mixed integer linear multi-objective optimization model and develops a constructive heuristic for fast trade-off analysis between makespan and energy consumption, which can serve as a visual aid for production and sales planners to consider energy consumption explicitly in making quick decisions while negotiating with customers on due dates.
Journal ArticleDOI
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
TL;DR: A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out and the results show that both the presented constructive heuristics and metaheuristics are very effective for solving the DPFSP with total flowtime criterion.
Journal ArticleDOI
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness
TL;DR: A metaheuristic based on simulated annealing which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of the proposed SA is applied.
Posted Content
HyFlex: A Benchmark Framework for Cross-domain Heuristic Search
TL;DR: HyFlex is presented, a software framework for the development of cross-domain search methodologies that features a common software interface for dealing with different combinatorial optimisation problems and provides the algorithm components that are problem specific.
References
More filters
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Book
Handbook Of Metaheuristics
Fred Glover,Gary A. Kochenberger +1 more
TL;DR: This book discusses Metaheuristic Class Libraries, Hyper-Heuristics, and Artificial Neural Networks for Combinatorial Optimization, which are concerned withMetaheuristic Algorithms and their applications in Search Technology.
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
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
Book
Stochastic Local Search: Foundations & Applications
Holger H. Hoos,Thomas Sttzle +1 more
TL;DR: This prologue explains the background to SLS, and some examples of applications can be found in SAT and Constraint Satisfaction, as well as some of the algorithms used to solve these problems.
Related Papers (5)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more