A note on unbounded parallel-batch scheduling

DOI10.1016/J.IPL.2015.07.002zbMath1337.90025OpenAlexW817947674MaRDI QIDQ495685

Jinjiang Yuan, Zhichao Geng

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.002

zbMATH Keywords

analysis of algorithmparallel-batch schedulingPareto optimizationstrongly polynomial timemaximum cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Hierarchical optimization on an unbounded parallel-batching machine ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times

Cites Work

• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Scheduling a batching machine
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item

This page was built for publication: A note on unbounded parallel-batch scheduling