Pages that link to "Item:Q2567845"
From MaRDI portal
The following pages link to A computational study of shifting bottleneck procedures for shop scheduling problems (Q2567845):
Displaying 23 items.
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops (Q342300) (← links)
- A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines (Q1743651) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A linear programming-based method for job shop scheduling (Q2434310) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
- Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
- Study on constraint scheduling algorithm for job shop problems with multiple constraint machines (Q3527958) (← links)
- Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study (Q3605414) (← links)
- Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
- Scheduling with product family set-up times: an application in TFT LCD manufacturing (Q4671319) (← links)
- A machine-order search space for job-shop scheduling problems (Q4814098) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- Combining prospect theory with fuzzy theory to handle disruption in production scheduling (Q5024608) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
