Serial-batching scheduling problem to minimize total weighted completion time

MaRDI QIDQ3614276zbMATH OpenFDO

Authors Le Tian, Chuanli Zhao

Publication date 6 March 2009

zbMATH Keywords

batchingschedulingweighting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Bicriteria scheduling on a series-batching machine to minimize makespan and total weighted completion time with equal length job
• Serial batch scheduling on uniform parallel machines to minimize total completion time
• Minimizing total weighted completion time on parallel unbounded batch machines
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme

Cited in

(6)

• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• Scheduling parallel batching machines in a sequence
• A note on special optimal batching structures to minimize total weighted completion time
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme
• An iterative approach for the serial batching problem with parallel machines and job families
• Serial batch scheduling on uniform parallel machines to minimize total completion time

This page was built for publication: Serial-batching scheduling problem to minimize total weighted completion time

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