Exact exponential algorithms for 3-machine flowshop scheduling problems
From MaRDI portal
Publication:1743653
DOI10.1007/s10951-017-0524-2zbMath1392.90066OpenAlexW2608378407WikidataQ115603733 ScholiaQ115603733MaRDI QIDQ1743653
Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt
Publication date: 13 April 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-017-0524-2
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms ⋮ Preface ⋮ Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights ⋮ Moderate exponential-time algorithms for scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the job-shop scheduling problem optimally by dynamic programming
- On an extension of the Sort \& Search method with application to scheduling theory
- Scheduling partially ordered jobs faster than \(2^n\)
- A note on permutation flow shop problem
- Exact exponential algorithms.
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- An adaptive branching rule for the permutation flow-shop problem
- 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
- Some results of the worst-case analysis for flow shop scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Optimal two- and three-stage production schedules with setup times included
- Exact Algorithms for Maximum Independent Set
- On Finding the Maxima of a Set of Vectors
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Flowshop-scheduling problems with makespan criterion: a review
- Bounding the Running Time of Algorithms for Scheduling and Packing Problems
This page was built for publication: Exact exponential algorithms for 3-machine flowshop scheduling problems
