期刊
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
卷 32, 期 3, 页码 365-373出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/002077201300029746
关键词
-
This paper is concerned wit the two-criteria problem in a two-machine flow shop. The objective was to find a job sequence that minimized both the total flow time and the tardiness. Several dominant properties for the precedence relationship between jobs are proposed and a lower bound on the flow time and tardiness value for a subproblem is derived. The computational results of a branch-and-bound algorithm are also reported.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据