Parallel machine scheduling with linearly decreasing processing times

MaRDI QIDQ5319889zbMATH OpenFDO

Authors Junjie Li, Chuanli Zhao

Publication date 22 July 2009

zbMATH Keywords

decrease linearlyparallel machineschedulingtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel-machine scheduling with time dependent processing times
• Scheduling jobs with piecewise linear decreasing processing times
• scientific article; zbMATH DE number 5951383
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Parallel-machine scheduling of simple linear deteriorating jobs

Cited in

(4)

• scientific article; zbMATH DE number 5951383 (Why is no real title available?)
• Scheduling jobs with piecewise linear decreasing processing times
• scientific article; zbMATH DE number 7339458 (Why is no real title available?)
• Approximation and Online Algorithms

This page was built for publication: Parallel machine scheduling with linearly decreasing processing times

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