Pages that link to "Item:Q613333"
From MaRDI portal
The following pages link to Minimizing the sum of weighted completion times in a concurrent open shop (Q613333):
Displaying 21 items.
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms (Q722523) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- On complexity of minimizing weighted number of late jobs in unit time open shops (Q1356519) (← links)
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs (Q1404274) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← links)
- Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- On scheduling coflows (Q2211360) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Green scheduling, flows and matchings (Q2344761) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Scheduling Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
- (Q3402497) (← links)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
- (Q5092350) (← links)
- Integer Programming and Combinatorial Optimization (Q5712462) (← links)
- Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)
