Dual Flow Shops Scheduling with Queue Time Constraint
碩士 === 國立交通大學 === 工業工程與管理系所 === 97 === This research examines a dual flow-shop scheduling problem, which allows cross-shop production and is with queue time constraint (also called Q-time window). Q-time window denotes the longest waiting time that a job is allowed to have between its two consecutiv...
Main Authors: | Lin, Chao-Hung, 林昭宏 |
---|---|
Other Authors: | Wu, Muh-Cherng |
Format: | Others |
Language: | zh-TW |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/56989757148244413157 |
Similar Items
-
Job-splitting and Batching Hybrid Flow Shop Scheduling Problem with Queue Time Constraints
by: Hao-Huai Chen, et al.
Published: (2014) -
Flow shop production scheduling problem with queue time constraint using Lagrangian relaxation
by: Chin-Chen Chou, et al.
Published: (2016) -
Dual Flow Shops Scheduling with Family Setup Times
by: Lin, Cih-Ying, et al.
Published: (2009) -
Integration of Multi-stage Manufacturing Shops with Queue-time Constraint
by: Cheng-Hao Huang, et al.
Published: (2010) -
No-wait Flexible Flow Shop Scheduling with Reentrant Constraints
by: HU, HAN, et al.
Published: (2019)