Complexity of scheduling with proportional deterioration and release dates

DOI10.1007/s40995-017-0466-8zbMath1397.90184OpenAlexW2781790977MaRDI QIDQ1787790

Cuixia Miao

Publication date: 5 October 2018

Published in: Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40995-017-0466-8

zbMATH Keywords

computational complexityschedulingdeteriorating jobsNP-hardness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Isomorphic scheduling problems
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Time-dependent scheduling
• Single machine parallel-batch scheduling with deteriorating jobs
• Scheduling jobs under simple linear deterioration
• Scheduling Deteriorating Jobs on a Single Processor
• Multiagent Scheduling

This page was built for publication: Complexity of scheduling with proportional deterioration and release dates