Optimal Sequencing of a Single Machine Subject to Precedence Constraints

Suppose n jobs are each to be processed by a single machine, subject to arbitrary given precedence constraints. Associated with each job j is a known processing time a j , and a monotone nondecreasing cost function c j ( t ), giving the cost that is incurred by the completion of that job at time t ....

Full description

Saved in:
Bibliographic Details
Published inManagement science Vol. 19; no. 5; pp. 544 - 546
Main Author Lawler, E. L
Format Journal Article
LanguageEnglish
Published Linthicum INFORMS 01.01.1973
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
Completion costs
Cost functions
Costs
Deadlines
Job shops
Management science
Minimization of cost
Production scheduling
Sequencing
Online AccessGet full text

Cover

More Information
Summary:Suppose n jobs are each to be processed by a single machine, subject to arbitrary given precedence constraints. Associated with each job j is a known processing time a j , and a monotone nondecreasing cost function c j ( t ), giving the cost that is incurred by the completion of that job at time t . The problem is to find a sequence which will minimize the maximum of the incurred costs. An efficient computational procedure is given for this problem, generalizing and simplifying previous results of the present author and J. M. Moore.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.19.5.544