Two scheduling problems in group technology with deteriorating jobs

DOI10.1007/s11766-005-0055-zzbMath1126.90020OpenAlexW2017402481MaRDI QIDQ2483767

Mingbao Cheng, Shijie Sun

Publication date: 27 July 2005

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-005-0055-z

zbMATH Keywords

schedulingNP-hard

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• The complexity of scheduling starting time dependent tasks with release times
• Scheduling jobs under simple linear deterioration
• Minimizing the total weighted completion time of deteriorating jobs
• Scheduling Deteriorating Jobs on a Single Processor
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Scheduling Groups of Jobs on a Single Machine
• Unnamed Item