One-machine, N-product-type, continuous-time scheduling with a common due date: A polynomially solvable case

One-machine, N-product-type, continuous-time scheduling with a common due date: A polynomially solvable case

0.00 Avg rating0 Votes
Article ID: iaor2002730
Country: United States
Volume: 33
Issue: 1
Start Page Number: 1
End Page Number: 10
Publication Date: Jan 2001
Journal: IIE Transactions
Authors:
Abstract:

The paper analyzes a manufacturing system made up of one-machine which produces N-product-types with controllable production rates in response to product demands. The demands are characterized by different amounts of each product-type to be produced and a common due date. The objective is to minimize inventory and backlog costs which are incurred when meeting the due date results in inventory surpluses and shortages. With the aid of the maximum principle, the continuous-time scheduling problem is studied as an optimal control model and is reduced to a combinatorial one, polynomially solvable when the costs are either ‘agreeable’ or when the number of the non-agreeable costs is limited.

Reviews

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