Pages that link to "Item:Q1362528"
From MaRDI portal
The following pages link to Minimizing the total completion time in a unit-time open shop with release times (Q1362528):
Displaying 10 items.
- Unit-time scheduling problems with time dependent resources (Q678109) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Total completion time minimization in two-machine job shops with unit-time operations (Q1278312) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242) (← links)
