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):
Displaying 10 items.
- Optimal job-shop scheduling with two jobs in systems with unrestricted paths (Q1323959) (← links)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- 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)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)