Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

DOI10.1007/s11590-012-0575-4zbMath1288.90032MaRDI QIDQ2439519

Yanyan Li

Publication date: 14 March 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0575-4

zbMATH Keywords

scheduling; makespan; release dates; batch processing

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Integrated scheduling of production and distribution for manufacturers with parallel batching facilities, Parallel-batch scheduling with deterioration and rejection on a single machine, Parallel batch scheduling with nested processing set restrictions, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines

Cites Work

• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• Minimizing makespan with release times on identical parallel batching machines
• On scheduling an unbounded batch machine
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals