Scheduling deteriorating jobs on a single machine to minimize the maximum processing times

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 to...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science 1996-05, Vol.27 (5), p.507-510
Main Authors: ALIDAEE, BAHRAM, LANDRAM, FRANK
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
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 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 tested. The algorithm can optimally solve the problem for some important special cases.
ISSN:0020-7721
1464-5319
DOI:10.1080/00207729608929242