15
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 1-10 | Received 01 Apr 1998, Accepted 01 Sep 1999, Published online: 27 Apr 2007
 

Abstract

The paper analyzes a manufacturing system made up of one-machine which produces TV-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.

Additional information

Notes on contributors

KONSTANTIN KOGAN

[email protected]

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.