首页 | 本学科首页   官方微博 | 高级检索  
     


An approximate solution of the flow-shop problem with sequence dependent setup times
Authors:Professor W. Szwarc  J. J. Liu
Affiliation:(1) School of Business Administration, University of Wisconsin-Milwaukee, P.O. Box 742, 53201 Milwaukee, Wisconsin, USA;(2) University of Wisconsin-Milwaukee, Milwaukee, Wiskonsin, USA
Abstract:The paper deals with anm machinen job flow-shop problem with sequence dependent setup times. To find an approximate solution of this model a related (additive) model was constructed and solved. The method proved to be successful to find good solutions for a variety of test problems form les 8 andn les 8. It guarantees optimality for the two machine case whenever the original model is additive.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号