Single machine scheduling problem with minimize total weighted early work

MaRDI QIDQ5017236zbMATH OpenFDO

Authors Ping Li, Zhang Xingong, Qing Wan

Publication date 17 December 2021

zbMATH Keywords

single machine schedulingdynamic programming algorithmtotal weighted early work

Mathematics Subject Classification ID

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

Recommendations

• A single machine scheduling problem to minimize total early work
• Two-agent single machine scheduling problem with the total weighted early work
• A parallel machine scheduling problem maximizing total weighted early work
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Single Machine Scheduling to Minimize Total Late Work

Cited in

(9)

• A parallel machine scheduling problem maximizing total weighted early work
• Minimizing the total weighted duration of courses in a single machine problem with precedence constraints
• A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
• A no-delay single machine scheduling problem to minimize total weighted early and late work
• A single machine scheduling problem to minimize total early work
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
• Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
• Mirror scheduling problems with early work and late work criteria
• Two-agent single machine scheduling problem with the total weighted early work

This page was built for publication: Single machine scheduling problem with minimize total weighted early work

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