Exact exponential algorithms for 3-machine flowshop scheduling problems
From MaRDI portal
Recommendations
- A New Heuristic for Three-Machine Flow Shop Scheduling
- On the optimality of exact and approximation algorithms for scheduling problems
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- Exact solution of the two-machine flow shop problem with three operations
- A new three-machine shop scheduling: complexity and approximation algorithm
Cites work
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- 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 note on permutation flow shop problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- An adaptive branching rule for the permutation flow-shop problem
- Bounding the running time of algorithms for scheduling and packing problems
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Exact Algorithms for Maximum Independent Set
- Exact exponential algorithms.
- Flowshop-scheduling problems with makespan criterion: a review
- On Finding the Maxima of a Set of Vectors
- On an extension of the Sort \& Search method with application to scheduling theory
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling algorithms
- Scheduling partially ordered jobs faster than \(2^n\)
- Solving the job-shop scheduling problem optimally by dynamic programming
- Some results of the worst-case analysis for flow shop scheduling
- The Complexity of Flowshop and Jobshop Scheduling
- Two branch and bound algorithms for the permutation flow shop problem
Cited in
(6)- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
- Preface
- Exact solution of the two-machine flow shop problem with three operations
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- Moderate exponential-time algorithms for scheduling problems
This page was built for publication: Exact exponential algorithms for 3-machine flowshop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743653)
