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.028zbMATH Open1245.90033OpenAlexW2018837601MaRDI QIDQ440896FDOQ440896

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

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

Cited In (3)

• Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness
• A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
• 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)