Minimizing makespan with release times on identical parallel batching machines

DOI10.1016/J.DAM.2004.11.004zbMath1066.90033OpenAlexW2051676433MaRDI QIDQ1775064

Shuguang Li, Shaoqiang Zhang, Guo Jun Li

Publication date: 4 May 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.11.004

zbMATH Keywords

SchedulingMakespanPolynomial time approximation schemeIdentical parallel batching machines

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items (17)

Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan ⋮ The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Scheduling hybrid flowshop with parallel batching machines and compatibilities ⋮ Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ Scheduling jobs with release dates on parallel batch processing machines ⋮ A PTAS for parallel batch scheduling with rejection and dynamic job arrivals ⋮ MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES

Cites Work

• Unnamed Item
• Scheduling a batching machine
• A PTAS for semiconductor burn-in scheduling
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Minimizing makespan with release times on identical parallel batching machines