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

Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

โœ Scribed by Fuh-Der Chou; Hui-Mei Wang; Tzu-Yun Chang

Publisher
Springer
Year
2008
Tongue
English
Weight
275 KB
Volume
43
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

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