By Topic

Lagrangian Relaxation for Parallel Machine Batch Scheduling with Deteriorating Jobs

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)
Shujun Jiang ; Sch. of Inf. Technol., Jiangxi Univ. of Finance & Econ., Nanchang, China

We investigate the problem of scheduling jobs with batch production on the identical parallel machines with respect to time-deteriorating processing time in which the processing time of a job is a piecewise linear deterioration function of its starting time. The objective is to find a feasible schedule that minimizes the total completion times of jobs. This paper proposes a batch decoupling based Lagrangian relaxation algorithm for this problem. In this algorithm, after capacity constraints are relaxed by Lagrangian multipliers, the relaxed problem can be decomposed into batch-level subproblems. The extensive computational experiments are carried out and the results show that the proposed algorithm can solve the problem effectively in a reasonable amount of the computation time.

Published in:

Management of e-Commerce and e-Government (ICMeCG), 2011 Fifth International Conference on

Date of Conference:

5-6 Nov. 2011