✦ LIBER ✦

Single machine scheduling with decreasing linear deterioration under precedence constraints

✍ Scribed by Ji-Bo Wang

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 538 KB
Volume: 58
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2009.03.108

No coin nor oath required. For personal study only.

✦ Synopsis

This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. It is shown that for the problems of minimization of the makespan, polynomial algorithms exist.

📜 SIMILAR VOLUMES

Two-agent single-machine scheduling prob

Two-agent single-machine scheduling problems under increasing linear deterioration

✍ Peng Liu; Na Yi; Xiaoye Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Scheduling resumable simple linear deter

Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

✍ Min Ji; T.C.E. Cheng 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

## a b s t r a c t We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. Th