No-wait shop scheduling: Computational complexity and approximate algorithms
Some of the recent results in deterministic no-wait shop scheduling are presented. In no-wait manufacturing environment, products or jobs must be processed, from their start to their completion, without any interruption on or between machines. This restriction may be due to the absence of intermediate storage capacity, or may be due to the processing technology itself. A number of shop models and objective functions have been considered in the paper in relation to the no-wait shop scheduling problem. The computational complexity of the various no-wait shop scheduling problems has been investigated. Approximate algorithms for the hard problems are presented and the worst case performance of these algorithms is discussed.
- Some no-wait shops scheduling problems: Complexity aspect
- scientific article; zbMATH DE number 733785
- scientific article; zbMATH DE number 5774288
- Approximative procedures for no-wait job shop scheduling.
- Inapproximability results for no-wait job shop scheduling.
- No-wait job shop scheduling: tabu search and complexity of subproblems
- Improved Approximation Algorithms for Shop Scheduling Problems
- scientific article; zbMATH DE number 1560345
- Approximability of flow shop scheduling
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- Some no-wait shops scheduling problems: Complexity aspect
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- Worst-case analysis of heuristics for open shops with parallel machines
- No-wait flow shop scheduling with large lot sizes
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- A survey of scheduling problems with no-wait in process
- Job-shop scheduling with blocking and no-wait constraints
- On a scheduling problem in a robotized analytical system
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Processing element allocation and dynamic scheduling codesign for multi-function SoCs
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- A review of TSP based approaches for flowshop scheduling
- Study on complex product scheduling problem with no-wait constraint between operations
- scientific article; zbMATH DE number 5774288 (Why is no real title available?)
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Syncrolift dry dock scheduling with a capacitated ship transfer system
- Scheduling two-machine no-wait open shops to minimize makespan
This page was built for publication: No-wait shop scheduling: Computational complexity and approximate algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113793)