✦ LIBER ✦

Scheduling jobs under simple linear deterioration

✍ Scribed by Gur Mosheiov

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 784 KB
Volume: 21
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(94)90080-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling deteriorating jobs to minimiz

Scheduling deteriorating jobs to minimize makespan

✍ Wieslaw Kubiak; Steef van de Velde 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem i

A note on scheduling deteriorating jobs

✍ G. Mosheiov 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Minimizing the number of tardy jobs unde

Minimizing the number of tardy jobs under piecewise-linear deterioration

✍ Ghasem Moslehi; Abbasali Jafari 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 343 KB

In this paper, we consider a single machine scheduling problem with piecewise-linear deterioration where its objective is to minimize the number of tardy jobs, in which the processing time of each job depends on its starting time where all the jobs have a specific deterioration rate. The problem is

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

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

Single machine scheduling with decreasin

Single machine scheduling with decreasing linear deterioration under precedence constraints

✍ Ji-Bo Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 538 KB

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. I