Pages that link to "Item:Q1316587"
From MaRDI portal
The following pages link to Scheduling two jobs with fixed and nonfixed routes (Q1316587):
Displayed 5 items.
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)