Machine scheduling problems with a general learning effect
โ Scribed by Xingong Zhang; Guangle Yan
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 494 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Scheduling with learning effects has received growing attention nowadays. A well-known learning model is called ''sum-of processing-times-based learning'' in which the actual processing time of a job is a nonincreasing function of the jobs already processed. However, the actual processing time of a
Learning effect Sum of completion times square Weighted sum of completion times Maximum lateness Number of tardy jobs a b s t r a c t In this study we consider the single-machine scheduling problem with a sum-ofprocessing-times-based learning effect. The sum-of-processing-times-based learning effec
This paper addresses single-machine scheduling problems under the consideration of learning effect and resource allocation in a group technology environment. In the proposed model of this paper the actual processing times of jobs depend on the job position, the group position, and the amount of reso