Pages that link to "Item:Q1879250"
From MaRDI portal
The following pages link to Minimizing mean completion time in a batch processing system (Q1879250):
Displaying 11 items.
- Single machine batch scheduling with release times (Q732326) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- On-line scheduling with rejection on identical parallel machines (Q882532) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
- On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971) (← links)
- A PTAS for semiconductor burn-in scheduling (Q1774521) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- (Q2861568) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)