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

DOI10.1016/J.TCS.2007.04.034zbMATH Open1206.90043OpenAlexW2018793254MaRDI QIDQ995579FDOQ995579

Authors Cheng He, Jinjiang Yuan, 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

maximum latenessPareto optimal solutionsbatching machinemulticriteria scheduling

Mathematics Subject Classification ID

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

Recommendations

• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
• Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
• Batching machine scheduling with bicriteria: maximum cost and makespan
• A DP algorithm for minimizing makespan and total completion time on a series-batching machine
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
• An improved algorithm for a bicriteria batching scheduling problem
• Bicriteria scheduling with double due dates to minimize the maximum lateness

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• A multiple-criterion model for machine scheduling
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Problems with Two Competing Agents
• Scheduling a batching machine
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

Cited in

(36)

• A kind of single machine parallel batch scheduling problems with three hierarchical criteria
• An improved algorithm for a bicriteria batching scheduling problem
• A note on unbounded parallel-batch scheduling
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
• An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
• Bicriteria scheduling on a series-batching machine to minimize makespan and total weighted completion time with equal length job
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• Improved dynamic programs for some batching problems involving the maximum lateness criterion
• Hierarchical optimization on an unbounded parallel-batching machine
• Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine
• Bicriterion scheduling with equal processing times on a batch processing machine
• Unbounded parallel-batch scheduling with drop-line tasks
• 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
• On the complexity of bi-criteria scheduling on a single batch processing machine
• 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
• Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
• Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• scientific article; zbMATH DE number 3821427 (Why is no real title available?)
• Bounded scheduling two-component jobs simultaneously or hierarchically
• Bi-criteria scheduling on a single parallel-batch machine
• Batching machine scheduling with bicriteria: maximum cost and makespan
• Bicriteria scheduling with double due dates to minimize the maximum lateness
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan
• Bi-objective scheduling on a restricted batching machine
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
• A bicriteria batch scheduling on a serial-batching machine
• Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
• Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
• scientific article; zbMATH DE number 1149801 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995579)