Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

DOI10.1080/00207540802010807zbMath1198.90174MaRDI QIDQ3055315

Yu Ting Tai, Shu-Hsing Chung, Wen Lea Pearn

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802010807

zbMATH Keywords

scheduling; parallel batch; unequal ready time

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B35: Deterministic scheduling theory in operations research

Related Items

A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, Integrated production and transportation on parallel batch machines to minimize total weighted delivery time, Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study, Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times, A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost, Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines, A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes, Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm, Solving single batch-processing machine problems using an iterated heuristic, Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms

Cites Work

• Efficient scheduling algorithms for a single batch processing machine
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling a single batch processing machine with non-identical job sizes
• Dynamic scheduling of batch servers with compatible product families
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes