Journal
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
Volume 32, Issue 3, Pages 365-373Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/002077201300029746
Keywords
-
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available