A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
type: Item
instance of: scholarly article
title: A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
zbMATH Open document ID: 1251.90204
author: Shiqing Yao
author: Zhibin Jiang
author: Na Li
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6107526
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: dynamic arrivals
zbMATH Keywords: batch scheduling
zbMATH Keywords: incompatible job families
MaRDI profile type: Publication
full work available at URL: j.cor.2011.06.003
OpenAlex ID: W1995270512
cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
cites work: Scheduling with batching: A review
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Batching identical jobs
cites work: Scheduling a batching machine
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: The use of upstream and downstream information in scheduling semiconductor batch operations
cites work: Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
cites work: A new dynamic look-ahead scheduling procedure for batching machines
cites work: Scheduling batch processing machines with incompatible job families
cites work: Minimizing total weighted tardiness on a single batch process machine with incompatible job families
cites work: Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
cites work: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
cites work: Q4017560
cites work: Lower bounds for parallel machine scheduling problems
cites work: Some simple scheduling algorithms
cites work: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
DOI: 10.1016/J.COR.2011.06.003
description: scientific article; zbMATH DE number 6107526