Journal ArticleDOI
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
Reads0
Chats0
TLDR
In this article, a heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling problem under study.About:
This article is published in European Journal of Operational Research.The article was published on 1997-11-16. It has received 168 citations till now. The article focuses on the topics: Null-move heuristic & Heuristic (computer science).read more
Citations
More filters
Journal ArticleDOI
A comprehensive review and evaluation of permutation flowshop heuristics
Rubén Ruiz,Concepción Maroto +1 more
TL;DR: This work presents a comparison of 25 methods, ranging from the classical Johnson's algorithm or dispatching rules to the most recent metaheuristics, including tabu search, simulated annealing, genetic algorithms, iterated local search and hybrid techniques, for the well-known permutation flowshop problem with the makespan criterion.
Journal ArticleDOI
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
TL;DR: A heuristic rule called the smallest position value (SPV) borrowed from the random key representation of Bean was developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems.
Journal ArticleDOI
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
TL;DR: A comparison of solutions yielded by the proposed ant-colony algorithms with the best heuristic solutions known for the benchmark problems, as published in an extensive study by Liu and Reeves is carried out.
Journal ArticleDOI
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
TL;DR: In this paper, the authors proposed an iterated greedy algorithm for the permutation flowshop scheduling problem with the makespan criterion and a referenced local search procedure to further improve the solution quality.
Journal ArticleDOI
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
Jose M. Framinan,Rainer Leisten +1 more
TL;DR: In this article, the authors proposed a heuristic for mean/total flowtime minimization in permutation flow shops, which exploits the idea of optimising partial schedules, already present in the NEH-heuristic (Omega 11 (1983) 91) with respect to makespan minimisation.
References
More filters
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.
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Journal ArticleDOI
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
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.
Book
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.