Pages that link to "Item:Q3880561"
From MaRDI portal
The following pages link to Complexity of Scheduling Shops with No Wait in Process (Q3880561):
Displaying 33 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- The proportionate two-machine no-wait job shop scheduling problem (Q322845) (← links)
- Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds (Q1804883) (← links)
- Lot sizing in a no-wait flow shop (Q1904756) (← links)
- On a scheduling problem in a robotized analytical system (Q1917278) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- An evolutionary approach to rehabilitation patient scheduling: A case study (Q2482797) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- The Open Shop Scheduling Problem (Q3304098) (← links)
- SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← links)
- FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC (Q3503068) (← links)
- A heuristic for the two-machine no-wait openshop scheduling problem (Q4239706) (← links)
- Incorporating preventive maintenance into the <i>m</i>-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study (Q5058979) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
- Computational complexity and algorithms for two scheduling problems under linear constraints (Q6495885) (← links)
- On the NP-hardness of two scheduling problems under linear constraints (Q6535800) (← links)
- Reentrant open shop scheduling problem with time lags and no-wait constraints (Q6568390) (← links)
