Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties

In this paper we consider parallel identical machines scheduling problems with deteriorating jobs. In this model, job processing times are defined by functions of their starting times. We concentrate on two goals separately, namely, minimizing the total absolute differences in completion times (TADC...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematical modelling Vol. 35; no. 3; pp. 1349 - 1353
Main Authors Huang, Xue, Wang, Ming-Zheng
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Inc 01.03.2011
Elsevier
Subjects
Applied sciences
Completion time
Deteriorating jobs
Deterioration
Exact sciences and technology
Mathematical analysis
Mathematical models
Modelling
Operational research and scientific management
Operational research. Management science
Parallel identical machines
Queuing theory. Traffic theory
Scheduling
Scheduling, sequencing
Scheduling
Parallel identical machines
Deteriorating jobs
Deterioration
Task scheduling
Parallel machines
Processing time
Modeling
Waiting time
Workload
Completion time
Execution time
Online AccessGet full text

Cover

More Information
Summary:In this paper we consider parallel identical machines scheduling problems with deteriorating jobs. In this model, job processing times are defined by functions of their starting times. We concentrate on two goals separately, namely, minimizing the total absolute differences in completion times (TADC) and the total absolute differences in waiting times (TADW). We show that the problems remains polynomially solvable under the proposed model.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0307-904X
DOI:10.1016/j.apm.2010.09.013