Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families

DOI10.1016/J.COR.2019.02.012zbMath1458.90325OpenAlexW2920140993WikidataQ128288129 ScholiaQ128288129MaRDI QIDQ1734827

Yupeng Li, Yan-Li Huang, Xiao-Lin Li

Publication date: 27 March 2019

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

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

zbMATH Keywords

heuristicslower boundbatch processing machinemaximum latenessjob families

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (2)

Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• CPLEX

Cites Work

• Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
• Batch scheduling to minimize maximum lateness
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Heuristic scheduling of jobs on a multi-product batch processing machine
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling batch processing machines with incompatible job families
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
• Scheduling

This page was built for publication: Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families