Inverse problems of single machine scheduling on processing times of jobs

MaRDI QIDQ3170385zbMATH OpenFDO

Authors Feng Zhang, Dewu Chen, Guochun Tang

Publication date 29 September 2011

zbMATH Keywords

inverse problemsingle machine schedulingtotal completion timerelevant deviation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The inverse parallel machine scheduling problem with minimum total completion time
• Inverse scheduling with maximum lateness objective
• Scheduling jobs with position and sum-of-processing-time based processing times
• Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
• scientific article; zbMATH DE number 2219122

Cited in

(4)

• Inverse scheduling with maximum lateness objective
• A note on reverse scheduling with maximum lateness objective
• The inverse parallel machine scheduling problem with minimum total completion time
• Inverse scheduling: Two-machine flow-shop problem

This page was built for publication: Inverse problems of single machine scheduling on processing times of jobs

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