Supply chain scheduling problem under simple linear deterioration on a single-machine with an unavailability constraint

DOI10.15960/J.CNKI.ISSN.1007-6093.2016.04.008MaRDI QIDQ5282675zbMATH OpenFDO

Authors Jing Fan, Xiwen Lu

Publication date 14 July 2017

zbMATH Keywords

dynamic programming algorithmsupply chain schedulingsimple linear deteriorationunavailability constraintfull polynomial time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Supply chain scheduling problem with multiple unavailability intervals on a single machine
• Supply chain scheduling problems with deteriorating jobs
• The supply chain scheduling with jobs' release times on a single machine
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

Cited in

(4)

• Supply chain scheduling with deteriorating jobs and delivery times
• Supply chain scheduling problems with deteriorating jobs
• Supply chain scheduling problem with multiple unavailability intervals on a single machine
• Supply chain scheduling problem in the hospital with periodic working time on a single machine

This page was built for publication: Supply chain scheduling problem under simple linear deterioration on a single-machine with an unavailability constraint

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