A note on special optimal batching structures to minimize total weighted completion time

DOI10.1007/S10878-007-9070-8zbMath1149.90061OpenAlexW1973894301MaRDI QIDQ2426655

Jinjiang Yuan, Yanpei Liu, Wenhua Li

Publication date: 23 April 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9070-8

zbMATH Keywords

SchedulingBatchingTotal weighted complete time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Scheduling a batching machine
• The complexity of one-machine batching problems
• On scheduling an unbounded batch machine
• Scheduling with batching: A review

This page was built for publication: A note on special optimal batching structures to minimize total weighted completion time