The following pages link to Scheduling (Q5900021):
Displaying 7 items.
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations (Q322604) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- Distribution systems design with role dependent objectives (Q1039797) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
- Robust scheduling with budgeted uncertainty (Q2414457) (← links)
