The Three-Machine No-Wait Flow Shop is NP-Complete
From MaRDI portal
Recommendations
Cited in
(58)- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- Some no-wait shops scheduling problems: Complexity aspect
- An approximate algorithm for the three-machine problem
- The job shop scheduling problem: Conventional and new solution techniques
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
- The complexity of scheduling jobs in repetitive manufacturing systems
- Two-stage no-wait scheduling models with setup and removal times separated
- Scheduling no-wait robotic cells with two and three machines
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- Nonpreemptive flowshop scheduling with machine dominance
- Flow shop scheduling with flexible processing times
- Three-machine flow shop scheduling with overlapping waiting time constraints
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- Parameterized complexity of machine scheduling: 15 open problems
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Complexity of flow shop scheduling problems with transportation constraints
- Lot sizing in a no-wait flow shop
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
- On Eulerian extensions and their application to no-wait flowshop scheduling
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- A review of TSP based approaches for flowshop scheduling
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- Scheduling in supply chain environment
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- scientific article; zbMATH DE number 3843477 (Why is no real title available?)
- scientific article; zbMATH DE number 4209899 (Why is no real title available?)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
- scientific article; zbMATH DE number 4154198 (Why is no real title available?)
- scientific article; zbMATH DE number 3978798 (Why is no real title available?)
- scientific article; zbMATH DE number 1279216 (Why is no real title available?)
- Scheduling for parallel dedicated machines with a single server
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- Permutation, no-wait, no-idle flow shop problems
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Flowshop-scheduling problems with makespan criterion: a review
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Part sequencing in three-machine no-wait robotic cells
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
- Fifty years of research in scheduling -- theory and applications
- Inapproximability results for no-wait job shop scheduling.
- Scheduling two-machine no-wait open shops to minimize makespan
- An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- New directions in scheduling theory
- Mathematical programming formulations for machine scheduling: A survey
- The no-wait flow-shop paradox
- On no-wait and no-idle flow shops with makespan criterion
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Predictive-reactive scheduling for single surgical suite subject to random emergency surgery
This page was built for publication: The Three-Machine No-Wait Flow Shop is NP-Complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769960)
