Pages that link to "Item:Q1768601"
From MaRDI portal
The following pages link to On-line scheduling a batch processing system to minimize total weighted job completion time (Q1768601):
Displayed 11 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- Single machine batch scheduling with release times (Q732326) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- A PTAS for semiconductor burn-in scheduling (Q1774521) (← links)
- Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- (Q2861568) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)