Pages that link to "Item:Q1278312"
From MaRDI portal
The following pages link to Total completion time minimization in two-machine job shops with unit-time operations (Q1278312):
Displayed 7 items.
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)