Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan

DOI10.1007/S10100-011-0220-9zbMath1339.90139OpenAlexW2078058343MaRDI QIDQ300969

Ji Tian, Yanpei Liu, Hao Lin, Cheng He

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-011-0220-9

zbMATH Keywords

Pareto optimal solutionsbatching machinemaximum latenessmulticriteria scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Bi-objective scheduling on a restricted batching machine ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Unbounded serial-batching scheduling on hierarchical optimization ⋮ Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• A multiple-criterion model for machine scheduling
• Multicriteria scheduling
• Scheduling Problems with Two Competing Agents
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan