Algorithms for two kinds of parallel batch scheduling with batching costs

DOI10.3969/J.ISSN.1005-3085.2013.04.016MaRDI QIDQ5400297zbMATH OpenOpenAlexFDO

Authors Zhe Zhang, Wenhua Li

Publication date 28 February 2014

Full work available at URL http://or.nsfc.gov.cn/bitstream/00001903-5/180489/1/1000014014316.pdf

zbMATH Keywords

dynamic programmingmaximum latenesstotal weighted completion timebatching costparallel batch

Mathematics Subject Classification ID

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

Recommendations

• Two problems about single machine parallel batching with batching costs
• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
• Batching machine scheduling with bicriteria: maximum cost and makespan
• Scheduling a batching machine

Cited in

(3)

• scientific article; zbMATH DE number 6501083 (Why is no real title available?)
• Two problems about single machine parallel batching with batching costs
• An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan

This page was built for publication: Algorithms for two kinds of parallel batch scheduling with batching costs

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