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
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
TL;DR: In this paper, a discrete artificial bee colony algorithm was proposed to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion, where idle time is not allowed on machines.
Journal ArticleDOI
A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop
TL;DR: A cooperative coevolution algorithm with problem-specific strategies is proposed by reasonably combining the estimation of distribution algorithm (EDA) and the iterated greedy (IG) search to optimize the fuzzy total tardiness and robustness simultaneously.
Journal ArticleDOI
A genetic-algorithm-based optimization model for scheduling flexible assembly lines
TL;DR: Experimental results demonstrate that the proposed optimization model can solve the scheduling problem in the flexible assembly line effectively.
Journal ArticleDOI
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
TL;DR: The analysis shows that a huge number of ties appear during the construction of the solutions done by the NEHedd heuristic, and that wisely breaking the ties greatly influences the quality of the final solution.
Journal ArticleDOI
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Jose M. Framinan,Rainer Leisten +1 more
TL;DR: In this article, a greedy algorithm was proposed to solve the problem of scheduling jobs in a permutation flow shop with the objective of minimizing the total tardiness of jobs in order to solve it.
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