Journal
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume 37, Issue 1, Pages 126-137Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2006.11.002
Keywords
flow-shop; heuristics; mathematical programming; search procedure; sequencing
Ask authors/readers for more resources
This paper presents a hybrid genetic algorithm/mathematical programming heuristic for the n-job, m-machine flowshop problems with lot streaming. The number of sublots for each job and the size of sublots are directly addressed by the heuristic and setups may be sequence-dependent. A new aspect of the problem, the interleaving of sublots from different jobs in the processing sequence, is developed and addressed. Computational results from 12 randomly generated test sets of 24 problems each are presented. (C) 2006 Elsevier Ltd. All rights reserved.
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