Pages that link to "Item:Q2628197"
From MaRDI portal
The following pages link to Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197):
Displaying 14 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
- Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
- An effective scheduling method to single-arm cluster tools for processing multiple wafer types (Q2691392) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
- Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes (Q2992407) (← links)
- Weak-restriction based algorithm for scheduling on parallel batch machines with arbitrary capacities (Q5381317) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
