An empirical analysis of the optimality rate of flow shop heuristics
From MaRDI portal
Publication:1027589
DOI10.1016/j.ejor.2008.08.021zbMath1163.90815OpenAlexW1965349461MaRDI QIDQ1027589
Jerzy Kamburowski, Pawel Jan Kalczynski
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.021
Related Items
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem, A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem, \(N\)-NEH+ algorithm for solving permutation flow shop problems, New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization, The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, Fast heuristics for minimizing the makespan in non-permutation flow shops, The distributed permutation flowshop scheduling problem, Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on permutation flow shop problem
- New results in the worst-case analysis for flow-shop scheduling
- Scheduling flow shops using differential evolution algorithm
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- Departures from many queues in series
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Approximability of flow shop scheduling
- Some results of the worst-case analysis for flow shop scheduling
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
- New heuristics for no-wait flowshops to minimize makespan.
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An ant colony system for permutation flow-shop sequencing
- The permutation flow shop with buffers: A tabu search approach
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Some aspects of scatter search in the flow-shop problem
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Performance guarantees for flowshop heuristics to minimize makespan
- Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- A Probabilistic Analysis of Two-Machine Flowshops
- A genetic algorithm for flow shop scheduling problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Flowshop-scheduling problems with makespan criterion: a review
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
