Sequency on two and three machines with setup, processing and removal times separated
作者:
DILEEPR. SULE,
KINYANN HUANG,
期刊:
International Journal of Production Research
(Taylor Available online 1983)
卷期:
Volume 21,
issue 5
页码: 723-732
ISSN:0020-7543
年代: 1983
DOI:10.1080/00207548308942406
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
njobs are to be processed on two or three machines. Each job must be processed in sequence, first on machine I than on machine II, etc. For each job, setup time, processing time, and removal time is known in each machine. Algorithms are developed which determine an optimal sequence that minimizes the total elapsed time. Numerical examples illustrate the algorithms.
点击下载:
PDF (281KB)
返 回