The following pages link to (Q3899811):
Displaying 17 items.
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- A classification scheme for vehicle routing and scheduling problems (Q913648) (← links)
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- Scheduling subject to resource constraints: Classification and complexity (Q1052820) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
- Scheduling chain-structured tasks to minimize makespan and mean flow time (Q1814098) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
