A new constructive heuristic for the flowshop scheduling problem
From MaRDI portal
Publication:1291704
DOI10.1016/S0377-2217(97)00027-1zbMath0957.90053OpenAlexW1996504887MaRDI QIDQ1291704
Publication date: 22 March 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00027-1
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (19)
A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ \(N\)-NEH+ algorithm for solving permutation flow shop problems ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach ⋮ A note on scheduling flowshops with flexible stage ordering ⋮ Flow shop scheduling with heterogeneous workers ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ An improved particle swarm optimization algorithm for flowshop scheduling problem ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ An improved genetic algorithm for the flowshop scheduling problem ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ Scheduling production tasks in a two-stage FMS ⋮ Flowshop-scheduling problems with makespan criterion: a review
Cites Work
- New results in the worst-case analysis for flow-shop scheduling
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Permutation vs. non-permutation flow shop schedules
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- A fast tabu search algorithm for the permutation flow-shop problem
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- A new heuristic for the n-job, M-machine flow-shop problem
- Optimal two- and three-stage production schedules with setup times included
- A survey and evaluation of static flowshop scheduling heuristics
- Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Note on Heuristics of Flow-Shop Scheduling
This page was built for publication: A new constructive heuristic for the flowshop scheduling problem
