Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
From MaRDI portal
Publication:6103746
DOI10.1007/s10951-022-00759-1zbMath1517.90054OpenAlexW4306698950MaRDI QIDQ6103746
Vincent T'kindt, Olivier Ploton
Publication date: 27 June 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-022-00759-1
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact exponential algorithms.
- Branch and bound algorithm for the flow shop with multiple processors
- An adaptive branching rule for the permutation flow-shop problem
- Dynamic programming meets the principle of inclusion and exclusion
- Two branch and bound algorithms for the permutation flow shop problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- 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
- Optimal two- and three-stage production schedules with setup times included
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Short Shop Schedules
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Bounding the Running Time of Algorithms for Scheduling and Packing Problems
This page was built for publication: Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
