Pages that link to "Item:Q2439519"
From MaRDI portal
The following pages link to Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519):
Displaying 8 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities (Q1800447) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← 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)