𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

✍ Scribed by Chuanli Zhao; Hengyong Tang

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
180 KB
Volume
59
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by functions dependent on their starting times. The following objectives are considered: the makespan, the total completion time, and the sum of earliness, tardiness, and due-window starting time and size penalties. We propose polynomial time algorithms to solve these problems.

πŸ“œ SIMILAR VOLUMES

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

Single-machine group scheduling with bot
Single-machine group scheduling with both learning effects and deteriorating jobs
✍ Xue Huang; Ming-Zheng Wang; Ji-Bo Wang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 205 KB

In the paper two resource constrained single-machine group scheduling problems with both learning effects and deteriorating jobs are considered. By learning effects, deteriorating jobs and group technology assumption, we mean that the processing time of a job is defined by the function of its starti