𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning

✍ Scribed by M. Duran Toksarı; Daniel Oron; Ertan Güner

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
417 KB
Volume
50
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

Job deterioration and machine learning co-exist in various real life scheduling settings. This paper studies several single machine scheduling problems under the joint effect of nonlinear job deterioration and time-dependent learning. We assume that the processing time of a job increases when its processing is delayed. In addition, it is assumed that the machine undergoes a learning process, decreasing the time required to process a given job. The following objectives are considered: the makespan, the sum of completion times (square) and the maximum lateness. We derive polynomial-time optimal solutions for all the objectives.

📜 SIMILAR VOLUMES

Notes on “Single machine scheduling prob
Notes on “Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning”
✍ Yunqiang Yin; Dehua Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We show by means of examples that Theorems 1-4 in Toksarı et al. [M.D. Toksarı, D. Oron, E. Güner, Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning, Mathematical and Computer Modelling 50 (2009) 401-406] are incorrect.

Single-machine scheduling with learning
Single-machine scheduling with learning effect and resource-dependent processing times
✍ Dan Wang; Ming-Zheng Wang; Ji-Bo Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 206 KB

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g

Single machine scheduling with exponenti
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
✍ Ji-Bo Wang; Dan Wang; Li-Yan Wang; Lin Lin; Na Yin; Wei-Wei Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 472 KB

In this paper we consider the single machine scheduling problem with exponential time-dependent learning effect and past-sequence-dependent (p-s-d) setup times. By the exponential time-dependent learning effect, we mean that the processing time of a job is defined by an exponent function of the tota

Some unrelated parallel machine scheduli
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects
✍ Wen-Hung Kuo; Chou-Jung Hsu; Dar-Li Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Total absolute deviation of job completion times Total load a b s t r a c t In this paper, we study an unrelated parallel machine scheduling problem with setup time and learning effects simultaneously. The setup time is proportional to the length of the already processed jobs. That is, the setup ti