Scheduling unrelated parallel batch processing machines with non-identical job sizes

DOI10.1016/j.cor.2013.06.016zbMath1348.90285OpenAlexW2012468641MaRDI QIDQ336679

Yan-Li Huang, Qi Tan, Huaping Chen, Xiao-Lin Li

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.016

zbMATH Keywords

heuristicsschedulingmakespanunrelated parallel batch processing machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Scheduling unrelated additive manufacturing machines with practical constraints ⋮ 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 ⋮ Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing ⋮ Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ MILP models to minimise makespan in additive manufacturing machine scheduling problems ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes

Cites Work

• Unnamed Item
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
• Efficient scheduling algorithms for a single batch processing machine
• Makespan minimization on single batch-processing machine via ant colony optimization
• Minimizing total completion time on a batch processing machine with job families
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• 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
• Scheduling
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: Scheduling unrelated parallel batch processing machines with non-identical job sizes