Minimizing Total Weighted Completion Time on Parallel Machines with Family Set-up Times
碩士 === 國立臺灣科技大學 === 工業管理系 === 97 === This thesis focuses on a parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The family set-up time is incurred whenever there is a switch of processing from a job in one family to a job in another...
Main Authors: | CHEN, LIANG-CHUAN, 陳良銓 |
---|---|
Other Authors: | Ching-Jong Liao |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/14774557072471087393 |
Similar Items
-
Minimize the total weighted completion time on parallel machines subject to machine and chamber eligibilities
by: Yu-An Tu, et al.
Published: (2018) -
Two-agent scheduling to minimize total weighted completion time on parallel identical machines
by: 林玫君
Published: (2013) -
Scheduling correlated parallel machines to minimize maximum lateness and total weighted completion time
by: ZHANG, YUN-XI, et al.
Published: (2018) -
Minimizing the total completion time of parallel machines with machine and chamber eligibilities
by: SSU-MIN CHANG, et al.
Published: (2018) -
Correlated Parallel Machine Scheduling with Release Times to Minimize Total Weighted Completion Time and Number of Tardy Jobs
by: YIN, TZU-YUEH, et al.
Published: (2018)