Pages that link to "Item:Q817121"
From MaRDI portal
The following pages link to Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121):
Displaying 12 items.
- 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)
- Parallel machine scheduling with precedence constraints and setup times (Q991370) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- Group-shop scheduling with sequence-dependent set-up and transportation times (Q1634110) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- Optimization of setup times in the furniture industry (Q1945078) (← links)
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems (Q2156606) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times (Q3623397) (← links)
- Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan (Q6177176) (← links)
