Journal ArticleDOI
Scheduling in flowshops to minimize total tardiness of jobs
TLDR
The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.Abstract:
The problem of scheduling in static flowshops is considered with the objective of minimizing mean or total tardiness of jobs. A heuristic algorithm based on the simulated annealing (SA) technique is developed. The salient features of the proposed SA algorithm are the development of two new perturbation schemes for use in the proposed SA algorithm and a new improvement scheme to improve the quality of the solutions. The proposed algorithm is evaluated by using the benchmark problems available in the literature. The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.read more
Citations
More filters
Journal ArticleDOI
Cooperative metaheuristics for the permutation flowshop scheduling problem
Eva Vallada,Rubén Ruiz +1 more
TL;DR: This work proposes cooperative metaheuristic methods for the permutation flowshop scheduling problem considering two objectives separately: total tardiness and makespan and concludes that the cooperative methods yield much better results than the sequential algorithms and state-of-the-art methods running in the same number of processors but without communications.
Journal ArticleDOI
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
TL;DR: In this article, a continuous algorithm for the no-idle permutation flowshop scheduling problem with tardiness criterion is proposed. But the problem is a variant of the well-known PFSP scheduling problem where idle time is not allowed on machines.
Journal ArticleDOI
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness
TL;DR: This paper addresses the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario, and proposes a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function.
Journal ArticleDOI
A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops
TL;DR: The proposed iterated greedy algorithm for solving the permutation flowshop scheduling problem with the objective of minimizing total tardiness uses a new formula for temperature calculation for acceptance criterion and the algorithm is hybridized with a random search algorithm to further enhance the solution quality.
Journal ArticleDOI
Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions
TL;DR: A rescheduling architecture for solving the problem based on a predictive-reactive strategy and a new method to calculate the reactive schedule in each rescheduled period is proposed and a methodology that allows the use of multi-objective performance metrics to evaluate dispatching rules is developed.
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.
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.
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.
Journal ArticleDOI
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
Edward Ignall,Linus Schrage +1 more
TL;DR: In this paper, the branch-and-bound technique was applied to two flow-shop scheduling problems, i.e., 2-machine and 3-machine, with the objective of minimizing the makespan.
Related Papers (5)
A comprehensive review and evaluation of permutation flowshop heuristics
Rubén Ruiz,Concepción Maroto +1 more