Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect

Kuo, Wen‐Hung; Yang, Dar-Li

doi:10.1016/j.ejor.2005.03.020

Cited by 235 publications

(81 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, n, represent the weighted sum of completion times, the maximum lateness and the number of tardy jobs of a given permutation, respectively. For convenience, we denote the time-dependent learning effect given by (1) by LE t [7]. We use 1|LE t |f (C) to denote single machine scheduling with a time-dependent learning effect that is job-independent.…”

Section: Problem Formulationmentioning

confidence: 99%

“…In this paper we consider the same model as that of Kuo and Yang [7], but with different objective functions. The remaining part of this paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

“…They also found polynomial time solutions for two special cases of the problem, i.e., identical processing times on each machine and an increasing series of dominating machines. Kuo and Yang [7] considered a single machine scheduling problem with a time-dependent learning effect. The time-dependent learning effect of a job is assumed to be a function of the total normal processing time of the jobs scheduled in front of it.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Single-machine scheduling with a time-dependent learning effect

Wang

Cheng

et al. 2008

International Journal of Production Economics

View full text Add to dashboard Cite

In this paper we consider the single machine scheduling problem with a time-dependent learning effect. The time-dependent learning effect of a job is assumed to be a function of the total normal processing time of the jobs scheduled in front of the job. For the following three objective functions: the weighted sum of completion times, the maximum lateness and the number of tardy jobs, we show by examples that the optimal schedule of the classical version is not optimal in the presence of a time-dependent learning effect. But for some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore's algorithm can construct an optimal sequence for these objective functions, respectively. We also give the worst-case error bound of these three rules for the general cases.

show abstract

Section: Problem Formulationmentioning

confidence: 99%

“…In this paper we consider the same model as that of Kuo and Yang [7], but with different objective functions. The remaining part of this paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Single-machine scheduling with a time-dependent learning effect

Wang

Cheng

et al. 2008

International Journal of Production Economics

View full text Add to dashboard Cite

show abstract

“…Under a time-dependent effect, the actual processing time of a job is a function of the start time of the job. Leaving aside less popular cumulative effects initiated by [5] and [6], the studies on the positional and the time-dependent effects have formed the bulk of publications in the area; see, e.g., a survey [7] and the book [8], the latter providing a comprehensive exposition on scheduling with time-dependent processing times. These two effects can be further classified as being either job-dependent or job-independent.…”

Section: Introductionmentioning

confidence: 99%

Combining time and position dependent effects on a single machine subject to rate-modifying activities

Rustogi

Strusevich

2014

Omega

View full text Add to dashboard Cite

Citation for this version held on GALA:Rustogi, Kabir and Strusevich, Vitaly (2014) Combining time and position dependent effects on a single machine subject to rate-modifying activities. London: Greenwich Academic Literature Archive. We introduce a general model for single machine scheduling problems, in which the actual processing times of jobs are subject to a combination of positional and timedependent effects, that are job-independent but additionally depend on certain activities that modify the processing rate of the machine, such as, e.g., maintenance. We focus on minimizing two classical objectives: the makespan and the sum of the completion times. The traditional classification accepted in this area of scheduling is based on the distinction between the learning and deterioration effects, on one hand, and between the positional effects and the start-time dependent effects, on the other hand. Our results show that in the framework of the introduced model such a classification is not necessary, as long as the effects are job-independent. The model introduced in this paper covers most previously known models. The solution algorithms are developed within the same general framework and their running times are no worse than those available earlier for problems with less general effects.

show abstract

“…Kuo and Yang (see,e.g., [3]) considered a single-machine scheduling problem with a time-dependent learning effect. There are n jobs to be Based on the two models of Biscup, Kuo and Yang, in this paper, we develop a new scheduling model with learning effects where the actual processing time of a job is not only a function of the total normal processing times of the jobs already processed, but also a function of the job's scheduled position.…”

Section: Introductionmentioning

confidence: 99%

The research of some single-machine scheduling problems

Liao¹,

Xin²

2013

Proceedings of the 2013 International Academic Workshop on Social Science (IAW-SC-13)

View full text Add to dashboard Cite

Abstract-In this paper, we develop a new scheduling model with learning effects where the actual processing time of a job is not only a function of the total normal processing times of the jobs already processed, but also a function of the job's scheduled position. We show that the single-machine scheduling problems to minimize make span and total complete time are still polynomially solvable under the proposed model. We further show that the single-machine scheduling problems minimizing the weighted sum of completion times and minimizing the maximum lateness are also polynomially solvable under certain conditions.

show abstract

Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect

Cited by 235 publications

References 9 publications

Single-machine scheduling with a time-dependent learning effect

Single-machine scheduling with a time-dependent learning effect

Combining time and position dependent effects on a single machine subject to rate-modifying activities

The research of some single-machine scheduling problems

Contact Info

Product

Resources

About