Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
From MaRDI portal
Publication:2664317
DOI10.1016/j.cor.2020.104964zbMath1458.90321OpenAlexW3025343767MaRDI QIDQ2664317
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104964
makespanbranch and bound algorithmflowshop schedulingpermutation flowshopmachine idle timedominance condition
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Uses Software
Cites Work
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A generalized constructive algorithm using insertion-based heuristics
- An adaptive branching rule for the permutation flow-shop problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- 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 new heuristic for the n-job, M-machine flow-shop problem
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Flowshop scheduling research after five decades
- Minimising Maximum Lateness in a Two-Machine Flowshop
- A survey and evaluation of static flowshop scheduling heuristics
- An improved genetic algorithm for the flowshop scheduling problem
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
- Flowshop-scheduling problems with makespan criterion: a review
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Elimination methods in them ×n sequencing problem
