Bell, D.E. (1974). A Job Shop Assignment Problem with Queuing Costs. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-74-009
Preview |
Text
WP-74-009.pdf Download (95kB) | Preview |
Abstract
Consider an assignment problem in which jobs are to be assigned to machines in such a way as to minimize the total cost of manufacture. In addition, there is, for each job, a queuing cost which is proportional to the time spent before completion. Each job takes a unit length of time to be completed once work is started on it by a machine. It will be shown that this problem may be formulated as a linear program whose optimal solution will be integral.
Item Type: | Monograph (IIASA Working Paper) |
---|---|
Research Programs: | System and Decision Sciences - Core (SDS) |
Depositing User: | IIASA Import |
Date Deposited: | 15 Jan 2016 01:40 |
Last Modified: | 27 Aug 2021 17:07 |
URI: | https://pure.iiasa.ac.at/162 |
Actions (login required)
View Item |