Two problems about single machine parallel batching with batching costs

MaRDI QIDQ2916672zbMATH OpenFDO

Authors Zhe Zhang, Qi Feng

Publication date 5 October 2012

Published in Journal of Foshan University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

batching costdynamic programminglate jobparallel batchregular functionsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Recommendations

• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• Algorithms for two kinds of parallel batch scheduling with batching costs
• Scheduling a batching machine
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• Batching machine scheduling with bicriteria: maximum cost and makespan

Cited in

(3)

• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• scientific article; zbMATH DE number 6501083 (Why is no real title available?)
• Algorithms for two kinds of parallel batch scheduling with batching costs

This page was built for publication: Two problems about single machine parallel batching with batching costs

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