๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Single-machine scheduling with deteriorating functions for job processing times

โœ Scribed by T.C.E. Cheng; Wen-Chiung Lee; Chin-Chia Wu

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
194 KB
Volume
34
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Single machine scheduling with past-sequ
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs
โœ Chuanli Zhao; Hengyong Tang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

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 func

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