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

DOI10.1051/RO/2023003MaRDI QIDQ6041237zbMATH OpenFDO

Authors

Publication date 26 May 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2023003

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)

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

Cited in

(7)

• Batching machine scheduling with bicriteria: 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
• Unbounded parallel-batch scheduling to minimize the total weighted tardy span
• A note on unbounded parallel-batch scheduling
• An improved algorithm for a bicriteria batching scheduling problem
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

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)