By Topic

Stochastic single machine scheduling with proportional job weights to minimize deviations of completion times from a common due date

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chunfu Jia ; Coll. of Inf. Technol. & Sci., Nankai Univ., Tianjin, China

Deterministic single machine scheduling to minimize total weighted absolute deviations of job completion times from a common due date (abbreviated by TWD) is a typical scheduling model in just-in-time manufacturing environment, and it is NP-hard. However, LPT (largest processing time) job schedule is optimal for the case where jobs' weights are proportional to their processing times. In this paper, we consider the stochastic counterpart of the TWD problem with proportional weights, where the processing times are arbitrary positive random variables, while the common due date is an exponentially distributed random variable. The optimal solution of the problem is derived. Moreover, the case where the machine is subject to stochastic breakdowns is also discussed. It is shown that the results can be extended to the situation where the machine is subject to stochastic breakdowns when the counting process describing machine breakdowns is characterized by a Poisson process and the down times are independent identically distributed.

Published in:

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on  (Volume:5 )

Date of Conference:

9-12 Dec. 2003