Pages that link to "Item:Q1775064"
From MaRDI portal
The following pages link to Minimizing makespan with release times on identical parallel batching machines (Q1775064):
Displaying 17 items.
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates (Q473611) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← 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)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
