Scheduling jobs under simple linear deterioration

Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

271 Scopus citations

Abstract

We consider simple linear deterioration of processing times, i.e. Pi = αit, where αi is a job dependent deterioration rate and t > 0 is the job's starting time. In this environment, we study most classical n-job, non-preemptive, single machine scheduling models, i.e. most commonly used performance measures are considered: makespan, flow-time, total tardiness, number of tardy jobs, etc. We show that all these models remain polynomially solvable.

Original languageAmerican English
Pages (from-to)653-659
Number of pages7
JournalComputers and Operations Research
Volume21
Issue number6
DOIs
StatePublished - Jul 1994

Fingerprint

Dive into the research topics of 'Scheduling jobs under simple linear deterioration'. Together they form a unique fingerprint.

Cite this