An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan

DOI10.1051/RO/2023003zbMATH Open1519.90072MaRDI QIDQ6041237FDOQ6041237

Author name not available (Why is that?)

Publication date: 26 May 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

zbMATH Keywords

makespanPareto optimal solutionsbicriteria schedulingmaximum costparallel-batching

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

   Recommendations

• BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN 👍 👎
• A note on unbounded parallel-batch scheduling 👍 👎
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan 👍 👎
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan 👍 👎
• Algorithms for Two Kinds of Parallel Batch Scheduling with Batching Costs 👍 👎

This page was built for publication: An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan

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