Complexity of scheduling with proportional deterioration and release dates

DOI10.1007/S40995-017-0466-8MaRDI QIDQ1787790zbMATH OpenOpenAlexFDO

Authors Cuixia Miao

Publication date 5 October 2018

Published in Iranian Journal of Science and Technology, Transactions A: Science (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityschedulingNP-hardnessdeteriorating jobs

Mathematics Subject Classification ID

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

Recommendations

• Minimizing the total weighted completion time of deteriorating jobs
• Parallel machine scheduling problems with proportionally deteriorating jobs
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• On a scheduling problem of time deteriorating jobs
• Preemptive scheduling with simple linear deterioration on a single machine

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Isomorphic scheduling problems
• Multiagent scheduling. Models and algorithms
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Scheduling jobs under simple linear deterioration
• Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Single machine group scheduling with decreasing time-dependent processing times subject to release dates
• Single machine parallel-batch scheduling with deteriorating jobs
• Time-dependent scheduling

Cited in

(5)

• Minmax common due-window assignment scheduling with deteriorating jobs
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• scientific article; zbMATH DE number 942479 (Why is no real title available?)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Single-machine time-dependent scheduling with proportional and delivery times

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

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