Minimizing the total tardiness on a two-machine flowshop scheduling problem with a precedence constraint
碩士 === 逢甲大學 === 統計學系統計與精算碩士班 === 102 === The tardiness criterion is one of the most prominent measures in the scheduling area. To keep the tardiness in a lower level means to reduce the penalties incurred for late jobs. On the other hand, the precedence constraint exists in some real-life scheduling...
Main Author: | 温志皓 |
---|---|
Other Authors: | 吳進家 |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/22806786859545697294 |
Similar Items
-
Minimizing the total completion time on two-machine flowshop scheduling problem with a precedence constraint
by: Yu Cheng, et al.
Published: (2014) -
Two-Machine No-wait Total Tardiness Flowshop Scheduling Problem
by: Sheng-Fa Yang, et al.
Published: (2006) -
Minimizing total tardiness for two-machine flowshop schedualing
by: Fan, En-Zu, et al.
Published: (1994) -
Two-machine flowshop scheduling to minimize the number of tardy jobs
by: Wan-Ling Shie, et al.
Published: (2004) -
A Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop
by: Ik Sun Lee
Published: (2020-01-01)