Pages that link to "Item:Q835609"
From MaRDI portal
The following pages link to Job shop scheduling with setup times, deadlines and precedence constraints (Q835609):
Displaying 20 items.
- The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
- Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- Job shop scheduling with deadlines (Q1383797) (← links)
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- Optimization of setup times in the furniture industry (Q1945078) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)