Solution of the Akers-Friedman Scheduling Problem

Włodzimierz Szwarc
Additional contact information
Włodzimierz Szwarc: Polytechnic Institute, Wroclaw, Poland

Operations Research, 1960, vol. 8, issue 6, 782-788

Abstract: The solution of the Akers-Friedman production scheduling problem for the case of two parts and m machines (2 × m ) is given. The combination of dynamic programming and graphical approaches makes the method of solution especially effective. Even for large m the solution is very quickly obtained by using the proposed method. The case n × m is discussed and a 3 × 10 example is solved.

Date: 1960
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.6.782 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:8:y:1960:i:6:p:782-788

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().