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 19 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
- Efficient scheduling algorithms for a single batch processing machine (Q1077325) (← links)
- Scheduling jobs with release times on a machine with finite storage (Q1330556) (← links)
- Scheduling one batch processor subject to job release dates (Q1582073) (← 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)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption (Q2434315) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
