An improved solution procedure for the

An improved solution procedure for the

0.00 Avg rating0 Votes
Article ID: iaor1992142
Country: United Kingdom
Volume: 42
Issue: 5
Start Page Number: 413
End Page Number: 417
Publication Date: May 1991
Journal: Journal of the Operational Research Society
Authors:
Abstract:

Given a set of n jobs to be processed on a single machine, the problem is to find an optimal job sequence that hierarchically minimizes a bi-criterion objective function. The primary criterion is the maximum value of a general non-decreasing penalty function of job completion time, while the secondary criterion is total job flow time. An extension of Emmons's result is presented on the basis of which an improved solution procedure is developed to reduce the computational effort to find the optimal solution.

Reviews

Required fields are marked *. Your email address will not be published.