Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
From MaRDI portal
Publication:4706278
DOI10.1080/00207540210161650zbMath1038.90027OpenAlexW2082762028MaRDI QIDQ4706278
Rainer Leisten, Chandrasekharan Rajendran, Jose M. Framinan
Publication date: 1 October 2003
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540210161650
Related Items
Job-shop production scheduling with reverse flows ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ Variability of completion time differences in permutation flow shop scheduling ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ \(N\)-NEH+ algorithm for solving permutation flow shop problems ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ The distributed permutation flowshop scheduling problem ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
