SCHEDULING JOBS WITH GENERAL LEARNING FUNCTIONS

This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of...

Full description

Saved in:
Bibliographic Details
Published in:Journal of systems science and systems engineering 2011-03, Vol.20 (1), p.119-125
Main Authors: Wang, Li-Yan, Wang, Jian-Jun, Wang, Ji-Bo, Feng, En-Min
Format: Article
Language:English
Subjects:
Completion time
Complexity
Economic Theory/Quantitative Economics/Mathematical Methods
Engineering
Learning
Operations Research/Decision Theory
Optimization
Scheduling
Sums
Technical Note
多项式可解
学习功能
学习效应
总完工时间
最大完工时间
最小化问题
调度问题
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of jobs that come before it in the sequence. Results show that even with the introduction of the sum-of-processing-time-based learning effect to job processing times, single-machine makespan minimization problems remain polynomially solvable. The curves of the optimal schedule of a total completion time minimization problem are V-shaped with respect to iob normal orocessinz times.
ISSN:1004-3756
1861-9576
DOI:10.1007/s11518-011-5154-1