Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Technical Note—Minimizing Average Flow Time with Parallel Machines
Home
Publications
Technical Note—Minimizing Average Flow Time with Parallel Machines
Technical Note—Minimizing Average Flow Time with Parallel Machines
Author:
WH
W. A. Horn
W. A. Horn
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 June 1973
journal article
Published by
Institute for Operations Research and the Management Sciences (INFORMS)
in
Operations Research
Vol. 21
(3)
,
846-847
DOI:
10.1287/opre.21.3.846
Abstract
This note shows that the assignment and sequencing of single-operation jobs in a parallel-machine environment can be formulated as an assignment problem. Means for reducing the size and computational difficulty of this problem are identified.
Keywords
NOTE
DIFFICULTY
JOBS
MINIMIZING AVERAGE
TIME WITH PARALLEL
AVERAGE FLOW TIME
Related articles
Cited
Cited by 166 articles
Scroll to top