BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN

DOI10.1142/S0217595914500250zbMath1302.90083OpenAlexW2046112815MaRDI QIDQ2931723

Yundong Mu, Hao Lin, Cheng He, Jinjiang Yuan

Publication date: 26 November 2014

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595914500250

zbMATH Keywords

computational complexityPareto optimal solutionsbatching machinemulticriteria schedulingmaximum cost

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

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

Cites Work

• A DP algorithm for minimizing makespan and total completion time on a series-batching machine
• 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
• A multiple-criterion model for machine scheduling
• Multicriteria scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

This page was built for publication: BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN