By Topic

Single-Machine Scheduling With Job-Position-Dependent Learning and Time-Dependent Deterioration

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
$33 $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

4 Author(s)
Yunqiang Yin ; Sch. of Math. & Inf. Sci., East China Inst. of Technol., Fuzhou, China ; Min Liu ; Jinghua Hao ; MengChu Zhou

Job deterioration and learning co-exist in many realistic scheduling situations. This paper introduces a general scheduling model that considers the effects of position-dependent learning and time-dependent deterioration simultaneously. In the proposed model, the actual processing time of a job depends not only on the total processing time of the jobs already processed but also on its scheduled position. This paper focuses on the single-machine scheduling problems with the objectives of minimizing the makespan, total completion time, total weighted completion time, discounted total weighted completion time, and maximum lateness based on the proposed model, respectively. It shows that they are polynomially solvable and optimal under certain conditions. Additionally, it presents some approximation algorithms based on the optimal schedules for the corresponding single-machine scheduling problems and analyzes their worst case error bound.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:42 ,  Issue: 1 )