Pages that link to "Item:Q2367419"
From MaRDI portal
The following pages link to Two machine open shop scheduling problem with setup, processing and removal times separated (Q2367419):
Displaying 9 items.
- A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581) (← links)
- Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
- Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
- Group technology approach to the open shop scheduling problem with batch setup times (Q1577474) (← 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)
- A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
- On non-permutation solutions to some two machine flow shop scheduling problems (Q4300604) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
