Single-Machine Scheduling to Minimize Absolute Value in Maximum Lateness with Deteriorating Jobs

Abstract:

Article Preview

In this paper, a single-machine scheduling problem with simple linear deterioration was explored. By simple linear deterioration, we mean that the processing time of a job is a simple linear function of its execution starting time and its deterioration rate. The objective of this study was to find a schedule that minimizes the absolute value of maximum lateness, where the due date of jobs are a common due date. Given that the cases of common due date is a given constant and variable, we showed that the problem can be solved in polynomial time, respectively. Some extensions of the problem were also delineated.

Info:

Periodical:

Advanced Materials Research (Volumes 201-203)

Edited by:

Daoguo Yang, Tianlong Gu, Huaiying Zhou, Jianmin Zeng and Zhengyi Jiang

Pages:

1054-1060

DOI:

10.4028/www.scientific.net/AMR.201-203.1054

Citation:

J. B. Wang et al., "Single-Machine Scheduling to Minimize Absolute Value in Maximum Lateness with Deteriorating Jobs", Advanced Materials Research, Vols. 201-203, pp. 1054-1060, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.