Single machine scheduling problem with nonlinear processing times

MaRDI QIDQ3537341zbMATH OpenFDO

Authors Chuanli Zhao, Heng-Yong Tang

Publication date 24 November 2008

zbMATH Keywords

maximum latenessnonlinear processing timesschedulingsingle machinesum of completion times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 2219123
• Single-machine scheduling with deteriorating jobs
• Single-machine scheduling with nonlinear deterioration
• Single-machine makespan minimization scheduling with nonlinear shortening processing times
• Single-machine scheduling problems with learning effects and non-linear setup times

Cited in

(4)

• Single-machine makespan minimization scheduling with nonlinear shortening processing times
• The local-global conjecture for scheduling with non-linear cost
• Order constraints for single machine scheduling with non-linear cost
• scientific article; zbMATH DE number 2219123 (Why is no real title available?)

This page was built for publication: Single machine scheduling problem with nonlinear processing times

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