Pages that link to "Item:Q1753395"
From MaRDI portal
The following pages link to Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395):
Displaying 8 items.
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Minimizing makespan with release times on identical parallel batching machines (Q1775064) (← links)
- Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
- Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
- (Q3194322) (← links)
- Approximation algorithms for batch scheduling with processing set restrictions (Q6124768) (← links)