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 single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect
โ Scribed by Yunqiang Yin; Dehua Xu; Jiayin Wang
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 276 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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