Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
From MaRDI portal
Publication:5289353
DOI10.1057/jors.1993.3zbMath0772.90053OpenAlexW2079121918MaRDI QIDQ5289353
Publication date: 23 August 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1993.3
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness, NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness, A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems, Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times, Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times, Minimizing total tardiness in permutation flowshops, Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem, Evaluating the impact of grammar complexity in automatic algorithm design, Algorithms for a two‐machine flowshop problem with jobs of two classes, Iterative Methods for Variational Inequalities, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, Cooperative metaheuristics for the permutation flowshop scheduling problem, Order scheduling with tardiness objective: improved approximate solutions, Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness, A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop, A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness, Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm, A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops, Flowshop-scheduling problems with makespan criterion: a review, A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Minimizing total tardiness on a two-machine re-entrant flowshop, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, Performance enhancements to tabu search for the early/tardy scheduling problem
