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):
Displaying 12 items.
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- 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)
- A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime (Q2061131) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← 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)
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
