Pages that link to "Item:Q1268190"
From MaRDI portal
The following pages link to The generalized shifting bottleneck procedure (Q1268190):
Displaying 17 items.
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- On the representation of the one machine sequencing problem in the shifting bottleneck heuristic (Q879326) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks (Q1278475) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
- An evolutionary approach to rehabilitation patient scheduling: A case study (Q2482797) (← links)
- Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
- The Shifting Bottleneck Procedure for Job Shop Scheduling (Q3778528) (← links)
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study (Q4717125) (← links)
- Using real options analysis to value reoptimization options in the shifting bottleneck heuristic (Q5438527) (← links)
- Solving the open shop scheduling problem (Q5939272) (← links)
- A note on the shifting bottleneck procedure for job shop scheduling (Q6136083) (← links)
