Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect

In this paper we consider single-machine scheduling problems with an exponential sum-of-actual-processing-time-based learning effect. By the exponential sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by an exponential function of the sum of...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 2010-11, Vol.60 (9), p.2673-2678
Main Authors: Wang, Ji-Bo, Sun, Lin-Hui, Sun, Lin-Yan
Format: Article
Language:English
Subjects:
Completion time
Computer simulation
Lateness
Learning
Learning effect
Mathematical models
Minimization
Optimization
Scheduling
Single machine
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:In this paper we consider single-machine scheduling problems with an exponential sum-of-actual-processing-time-based learning effect. By the exponential sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by an exponential function of the sum of the actual processing times of the already processed jobs. For the proposed learning model, we show that under certain conditions, the makespan minimization problem, the sum of the θ th ( θ > 0 ) powers of completion times minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem all remain polynomially solvable.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2010.09.005