This paper deals with single-machine scheduling problems with decreasing linear deterioration, i.e., jobs whose processing times are a decreasing function of their starting times. In addition, the jobs are related by parallel chains and a series-parallel graph precedence constraints, respectively. I
Two-agent single-machine scheduling problems under increasing linear deterioration
✍ Scribed by Peng Liu; Na Yi; Xiaoye Zhou
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 260 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Job deterioration and machine learning co-exist in various real life scheduling settings. This paper studies several single machine scheduling problems under the joint effect of nonlinear job deterioration and time-dependent learning. We assume that the processing time of a job increases when its pr
We show by means of examples that Theorems 1-4 in Toksarı et al. [M.D. Toksarı, D. Oron, E. Güner, Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning, Mathematical and Computer Modelling 50 (2009) 401-406] are incorrect.
Scheduling with learning effects has received a lot of research attention lately. By learning effect, we mean that job processing times can be shortened through the repeated processing of similar tasks. On the other hand, different entities (agents) interact to perform their respective tasks, negoti