A network flow approach to optimal slack due-date determination

A network flow approach to optimal slack due-date determination

0.00 Avg rating—0 Votes
Article ID: iaor1991972
Country: Netherlands
Volume: 18
Issue: 3
Start Page Number: 265
End Page Number: 267
Publication Date: Jan 1990
Journal: Engineering Costs and Production Economics
Authors:
Abstract:

Cheng considers the problem of finding optimal slack due-dates in the context of sequencing n jobs on a single machine by the method of duality theory of linear programming. In this note a network flow approach to the problem is presented and the optimal slack due-date is thus determined in a simpler way.

Reviews

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