Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect

DOI10.1016/J.AMC.2012.03.028MaRDI QIDQ440896zbMATH OpenOpenAlexFDO

Authors Zhongyi Jiang, Fangfang Chen, Chunqing Wu

Publication date 19 August 2012

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.03.028

zbMATH Keywords

maximum latenessNP-completenessschedulinglearning effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A state-of-the-art review on scheduling with learning effects
• Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Scheduling time-dependent jobs under mixed deterioration
• Scheduling with general job-dependent learning curves.
• Time-dependent scheduling

Cited in

(3)

• A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
• Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness
• A short note on ``A note on single-machine scheduling with job-dependent learning effects

This page was built for publication: Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect

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