Parallel machines scheduling with rate-modifying activities and total absolute differences penalties

MaRDI QIDQ5742864zbMATH OpenFDO

Authors Yu-Bin Wu

Publication date 8 May 2019

zbMATH Keywords

identical parallel machinespolynomial algorithmrate-modifying activitiesscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two-parallel machines scheduling with rate-modifying activities to minimize total completion time
• Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• Machine scheduling with a rate-modifying activity
• Problems of single-machine scheduling with rate-modifying activities under deterioration

Cited in

(6)

• Two-parallel machines scheduling with rate-modifying activities to minimize total completion time
• Machine scheduling with a rate-modifying activity
• Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
• Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties

This page was built for publication: Parallel machines scheduling with rate-modifying activities and total absolute differences penalties

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