On some lower bounds for the permutation flowshop problem
From MaRDI portal
Publication:6047866
DOI10.1016/j.cor.2023.106320OpenAlexW4381433692MaRDI QIDQ6047866
Sebastian Cáceres Gelvez, Thu Huong Dang, Adam N. Letchford
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106320
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- Two branch and bound algorithms for the permutation flow shop problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- 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 computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- A study of integer programming formulations for scheduling problems
- Integer Programming
- Comparative evaluation of MILP flowshop models
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Scheduling
This page was built for publication: On some lower bounds for the permutation flowshop problem
