A heuristic for minimizing total weighted tardiness in the two-machine flowshop problem when jobs have processing times min(P1) > max(P2)
College
Gokongwei College of Engineering
Department/Unit
Industrial Engineering
Document Type
Article
Source Title
DLSU Engineering Journal
Volume
18
First Page
152
Last Page
166
Publication Date
3-2006
html
Recommended Citation
Siy, E. A. (2006). A heuristic for minimizing total weighted tardiness in the two-machine flowshop problem when jobs have processing times min(P1) > max(P2). DLSU Engineering Journal, 18, 152-166. Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/10082
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Upload File
wf_no
COinS
