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

DOI10.1016/J.COR.2019.02.012MaRDI QIDQ1734827zbMATH OpenOpenAlexWikidataFDO

Authors Yupeng Li, Xiaolin Li, Yanli Huang

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

batch processing machineheuristicsjob familieslower boundmaximum lateness

Mathematics Subject Classification ID

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

Recommendations

• Scheduling batch processing machines with incompatible job families
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families
• Batch scheduling to minimize maximum lateness
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Optimal methods for batch processing problem with makespan and maximum lateness objectives

Cites work

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

Cited in

(9)

• Batch scheduling to minimize maximum lateness
• A survey of scheduling with parallel batch (p-batch) processing
• Minimizing maximum tardiness on a single machine with family setup times and machine disruption
• Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective
• Customer order scheduling on a serial-batch machine in precast bridge construction
• Novel mathematical formulations for parallel-batching processing machine scheduling problems
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families
• A mixed integer programming model and dynamic programming-based approach for multi-product production scheduling under deterioration effect
• Optimal methods for batch processing problem with makespan and maximum lateness objectives

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734827)