Pages that link to "Item:Q1374404"
From MaRDI portal
The following pages link to On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404):
Displayed 6 items.
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)