Pages that link to "Item:Q2480060"
From MaRDI portal
The following pages link to Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints (Q2480060):
Displayed 7 items.
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
- Scheduling with returnable containers (Q906554) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)