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
Single machine scheduling with a learning effect and discounted costs
โ Scribed by Ji-Bo Wang; Linhui Sun; Linyan Sun
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 290 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0268-3768
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g
We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early com