Pages that link to "Item:Q3798473"
From MaRDI portal
The following pages link to Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates (Q3798473):
Displayed 14 items.
- Scheduling ordered open shops (Q580167) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- On complexity of minimizing weighted number of late jobs in unit time open shops (Q1356519) (← links)
- Minimizing the total completion time in a unit-time open shop with release times (Q1362528) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← 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)
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- Minimizing the weighted number of late jobs in UET open shops (Q4698122) (← links)