A note on single-machine scheduling problems with the effects of deterioration and learning

This paper studies two single-machine scheduling problems with the effect of deterioration and learning. In this model, the processing times of jobs are defined as functions of their starting times and positions in a sequence. For the following two objective functions: the weighted sum of completion...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2012-03, Vol.59 (5-8), p.539-545
Main Authors: Wang, Li-Yan, Feng, En-Min
Format: Article
Language:English
Subjects:
CAE) and Design
Computer-Aided Engineering (CAD
Deterioration
Engineering
Heuristic
Industrial and Production Engineering
Job shops
Lateness
Learning
Mechanical Engineering
Media Management
Original Article
Production scheduling
Scheduling
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 studies two single-machine scheduling problems with the effect of deterioration and learning. In this model, the processing times of jobs are defined as functions of their starting times and positions in a sequence. For the following two objective functions: the weighted sum of completion times and the maximum lateness, this paper proposes two heuristics according to the corresponding single machine problems without learning effect. This paper also gives the worst-case error bound for the heuristics and provides computational results to evaluate the performance of the heuristics.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-011-3528-7