Batch scheduling on uniform machines to minimize total flow-time
type: Item
instance of: scholarly article
title: Batch scheduling on uniform machines to minimize total flow-time
zbMATH Open document ID: 1251.90171
author: Baruch Mor
author: Gur Mosheiov
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6107488
zbMATH Keywords: batch scheduling
zbMATH Keywords: uniform machines
zbMATH Keywords: flowtime
MaRDI profile type: Publication
full work available at URL: j.cor.2011.05.014
OpenAlex ID: W2042681858
cites work: Batching in single operation manufacturing systems
cites work: One-pass batching algorithms for the one-machine problem
cites work: A polynomial algorithm for a one machine batching problem
cites work: Minimizing flow-time on a single machine with integer batch sizes
cites work: A survey of scheduling problems with setup times or costs
cites work: Scheduling groups of unit length jobs on two identical parallel machines.
DOI: 10.1016/J.COR.2011.05.014
Recommended article: Minimizing the maximum flow time in batch scheduling
Recommended article: Serial batch scheduling on uniform parallel machines to minimize total completion time
Recommended article: ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
Recommended article: Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
Recommended article: Preemptive scheduling on uniform machines to minimize mean flow time
Recommended article: Minimizing flow-time on a single machine with integer batch sizes
Recommended article: Scheduling an unbounded batching machine with job processing time compatibilities
Recommended article: Batching and scheduling in a multi-machine flow shop
Recommended article: Scheduling a proportionate flow shop of batching machines
description: scientific article; zbMATH DE number 6107488