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

Considerations of single-machine scheduling with deteriorating jobs

โœ Scribed by Chuan-Li Zhao; Chou-Jung Hsu; Dar-Li Yang

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
220 KB
Volume
35
Category
Article
ISSN
0307-904X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

A branch and bound algorithm for single
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
โœ Theodore G. Voutsinas; Costas P. Pappis ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the