Parallel-machine scheduling with time dependent processing times

Authors:
Wen-Hung Kuo;Dar-Li Yang
Affiliations:
Department of Information Management, National Formosa University, Yun-Lin, 632, Taiwan, ROC;Department of Information Management, National Formosa University, Yun-Lin, 632, Taiwan, ROC
Venue:
Theoretical Computer Science
Year:
2008

Citing 3
Cited 4

Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81–93]

Discrete Applied Mathematics

Parallel-machine scheduling with deteriorating jobs and rejection

Theoretical Computer Science
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities

Computers and Operations Research
Unrelated parallel-machine scheduling problems with multiple rate-modifying activities

Information Sciences: an International Journal
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

Computers and Operations Research

Quantified Score

Hi-index	5.23

Visualization

Abstract

In the literature, most of the parallel-machine scheduling problems, in which the processing time of a job is a linear function of its starting time, are proved to be NP-hard. In this paper, we study a parallel-machine scheduling problem in which the processing time of a job is a linear function of its starting time. The objectives are to minimize the total completion of all jobs and the total load on all machines respectively. We consider two linear functions of job starting time and show that the problems are polynomially solvable.