scientific article; zbMATH DE number 1279216
From MaRDI portal
Publication:4239706
DOI<129::AID-NAV1>3.0.CO;2-3 10.1002/(SICI)1520-6750(199903)46:2<129::AID-NAV1>3.0.CO;2-3zbMath0922.90091MaRDI QIDQ4239706
Jeffrey B. Sidney, Chelliah Skriskandarajah
Publication date: 4 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The two-machine no-wait general and proportionate open shop makespan problem, 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, A survey of scheduling problems with no-wait in process, Inapproximability results for no-wait job shop scheduling., Scheduling two-machine no-wait open shops to minimize makespan, A review of TSP based approaches for flowshop scheduling
Cites Work
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Complexity of Scheduling Shops with No Wait in Process
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
