A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

DOI10.1016/j.cor.2011.06.003zbMath1251.90204OpenAlexW1995270512MaRDI QIDQ1762063

Shiqing Yao, Na Li, Zhibin Jiang

Publication date: 15 November 2012

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

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

zbMATH Keywords

branch and bound algorithmbatch schedulingdynamic arrivalsincompatible job families

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (6)

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ A survey of scheduling with parallel batch (p-batch) processing

Cites Work

• Unnamed Item
• Lower bounds for parallel machine scheduling problems
• A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
• Scheduling a batching machine
• Batching identical jobs
• A new dynamic look-ahead scheduling procedure for batching machines
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families
• Scheduling with batching: A review
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
• The use of upstream and downstream information in scheduling semiconductor batch operations
• Scheduling batch processing machines with incompatible job families
• Some simple scheduling algorithms
• Scheduling Groups of Jobs on a Single Machine
• Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
• Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

This page was built for publication: A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals