Paper Info
Title
Scheduling Deteriorating Jobs On A Single Machine To Minimize The Maximum Processing Times
Abstract
In many real-world scheduling problems the processing time of a job is a variable and depends on a function of its starting time. The origin of the mathematical modelling of these types of sequencing problems is new and most studies have concentrated on minimizing the makespan, and minimizing the total completion times. This paper addresses the problem of sequencing a set of n independent jobs on a single machine when the processing time of a job is a linear function of its starting time, with the objective of minimizing the maximum processing times. A heuristic algorithm for the problem is presented. The effectiveness of the algorithm is computationally rested. The algorithm can optimally solve the problem for some important special cases.
Year
DOI
Venue
1996
10.1080/00207729608929242
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
Field
DocType
Volume
Mathematical optimization,Job shop scheduling,Computer science,Scheduling (computing),Heuristic (computer science),Algorithm,Linear function
Journal
27
Issue
ISSN
Citations 
5
0020-7721
3
PageRank 
References 
Authors
1.26
1
2
Name
Order
Citations
PageRank
Bahram Alidaee143935.91
Frank G. Landram2193.84