scientific article; zbMATH DE number 1279216
From MaRDI portal
Publication:4239706
DOI10.1002/(SICI)1520-6750(199903)46:2%3C129::AID-NAV1%3E3.0.CO;2-3zbMATH Open0922.90091MaRDI QIDQ4239706FDOQ4239706
Authors: Jeffrey B. Sidney, Chelliah Sriskandarajah 
Publication date: 4 October 1999
Title of this publication is not available (Why is that?)
Recommendations
- Scheduling two-machine no-wait open shops to minimize makespan
- A heuristic algorithm for open-shop scheduling problems with a single server
- Worst-case analysis of heuristics for open shops with parallel machines
- Two-stage open shop scheduling with a bottleneck machine
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Complexity of Scheduling Shops with No Wait in Process
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- The Three-Machine No-Wait Flow Shop is NP-Complete
Cited In (17)
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- Title not available (Why is that?)
- A review of TSP based approaches for flowshop scheduling
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
- The two-machine no-wait general and proportionate open shop makespan problem
- Title not available (Why is that?)
- Scheduling two-machine no-wait open shops to minimize makespan
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Inapproximability results for no-wait job shop scheduling.
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- Two-stage open shop scheduling with a bottleneck machine
- Worst-case analysis of heuristics for open shops with parallel machines
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- A survey of scheduling problems with no-wait in process
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4239706)
