Bicriteria scheduling on a series-batching machine to minimize makespan and total weighted completion time with equal length job

zbMATH Open1313.90087MaRDI QIDQ5497535FDOQ5497535

Authors: Cheng He, Hao Lin, Junmei Dou, Yundong Mu 

Publication date: 11 February 2015

Recommendations

• A DP algorithm for minimizing makespan and total completion time on a series-batching machine
• Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
• Bi-criteria scheduling on a single parallel-batch machine

zbMATH Keywords

makespantotal weighted completion timebicriteria schedulingPareto optimal schedulesseries-batching

Mathematics Subject Classification ID

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

Cited In (6)

• Bicriteria scheduling of equal length jobs on uniform parallel machines
• Serial-batching scheduling problem to minimize total weighted completion time
• Bounded serial-batching scheduling for minimizing maximum lateness and makespan
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
• A DP algorithm for minimizing makespan and total completion time on a series-batching machine
• Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs

This page was built for publication: Bicriteria scheduling on a series-batching machine to minimize makespan and total weighted completion time with equal length job

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