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

DOI10.1016/J.TCS.2007.04.034zbMath1206.90043OpenAlexW2018793254MaRDI QIDQ995579

Jinjiang Yuan, Cheng He, Yanpei Liu

Publication date: 3 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.034

zbMATH Keywords

Pareto optimal solutionsbatching machinemaximum latenessmulticriteria scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (18)

Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan ⋮ Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Hierarchical optimization on an unbounded parallel-batching machine ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Bi-criteria scheduling on a single parallel-batch machine ⋮ A note on unbounded parallel-batch scheduling ⋮ Optimal methods for batch processing problem with makespan and maximum lateness objectives ⋮ A DP algorithm for minimizing makespan and total completion time on a series-batching machine ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ 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

• Unnamed Item
• 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
• 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

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