Complexity of scheduling tasks with time-dependent execution times

Ho, Kevin; Leung, Joseph Y.-T.; Wen, Wei

doi:10.1016/0020-0190(93)90175-9

Cited by 97 publications

(45 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This model was introduced by Ho et al [11]. Ho et al [11] considered the problem of solution feasibility with deadline restrictions.…”

Section: Introductionmentioning

confidence: 98%

“…This model was introduced by Ho et al [11]. Ho et al [11] considered the problem of solution feasibility with deadline restrictions. Ng et al [20] considered three scheduling problems with a decreasing linear model of the job processing times, where the objective function is to minimize the total completion time, and two of the problems were solved optimally.…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Flow shop scheduling with effects of learning and deterioration

Wang

Lin

Shan

2008

J. Appl. Math. Comput.

View full text Add to dashboard Cite

In this paper we consider the flow shop scheduling problems with the effects of learning and deterioration. In this model the processing times of a job is defined as a function of its starting time and position in a sequence. The scheduling objective functions are makespan and total completion time. We prove that even with the introduction of learning effect and deteriorating jobs to job processing times, some special flow shop scheduling problems remain polynomially solvable.

show abstract

“…This model was introduced by Ho et al [11]. Ho et al [11] considered the problem of solution feasibility with deadline restrictions.…”

Section: Introductionmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 98%

Flow shop scheduling with effects of learning and deterioration

Wang

Lin

Shan

2008

J. Appl. Math. Comput.

View full text Add to dashboard Cite

show abstract

“…The problem 1|p i = a i − b i t, d i = d|C max was first introduced by Ho, et al [7] For this problem, they considered the problem feasibility with deadline restrictions and gave a polynomial time solvable algorithm. Cheng, et al [8] proved that the problem 1|p i = a i − b i t, d i |C max is strongly NP-hard and the problems 1|p…”

Section: Introductionmentioning

confidence: 99%

A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time

Sun

2008

J. Shanghai Univ.(Engl. Ed.)

View full text Add to dashboard Cite

In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.

show abstract

“…Gawiejnowicz (2008) gave a detailed review on single-machine scheduling problems with time-dependent processing times. Generally, there are two types of time-dependencies under studies: the actual processing times are characterized by either non-decreasing or non-increasing functions (Ho et al 1993). Research works regarding linear decreasing deterioration include Bachman et al (2002), Wang andLiu (2009), andYang (2010).…”

mentioning

confidence: 99%

Single-machine scheduling problems with time and position dependent processing times

et al. 2011

View full text Add to dashboard Cite

We consider single-machine scheduling problems with time and position dependent job processing times. In many industrial settings, the processing time of a job changes due to either job deterioration over time or machine/worker's learning through experiences. In the models we study, each job has its normal processing time. However, a job's actual processing time depends on when its processing starts and how many jobs have completed before its start. We prove that the classical SPT (Shortest Processing Time) rule remains optimal when we minimize the makespan or the total completion time. For problems of minimizing the total weighted completion time, the maximum lateness, and the discounted total weighted completion time, we present heuristic sequencing rules and analyze the worstcase bounds for performance ratios. We also show that these heuristic rules can be optimal under some agreeable conditions between the normal processing times and job due dates or weights.Keywords Single-machine scheduling · Learning effect · Performance ratio · Worst-case error 1 Introductions and literature review

show abstract

Complexity of scheduling tasks with time-dependent execution times

Cited by 97 publications

References 2 publications

Flow shop scheduling with effects of learning and deterioration

Flow shop scheduling with effects of learning and deterioration

A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time

Single-machine scheduling problems with time and position dependent processing times

Contact Info

Product

Resources

About