A New Lower Bound Scheme for Production Scheduling in Flowshops
碩士 === 國立暨南國際大學 === 資訊管理學系 === 91 === The purpose of this study is to present a simple and effective lower bound for the minimization of total completion time in a two-machine flowshop and extend the lower bound for the general bicriteria problem in a two-machine flowshop. The two problems are known...
Main Authors: | Jia-Ming Wu, 吳家銘 |
---|---|
Other Authors: | Miao-Tsong Lin |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/65710971682668886066 |
Similar Items
-
The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures
by: Anis Gharbi, et al.
Published: (2014-01-01) -
Scheduling No-Wait Flowshops Using a Hybrid Metaheuristic
by: Wei-Ming Chao, et al.
Published: (2018) -
An Application On Flowshop Scheduling
by: Sündüz Dağ
Published: (2013-12-01) -
Distributed Flowshop Scheduling Problems with Blocking Constrain
by: Chien-Hua Wu, et al.
Published: (2013) -
The Investigation of Group Scheduling Problem on Flowshop
by: Tsung-Ming Chen, et al.