Two-Machine Flow Shops Scheduling to Minimize Job Independent Earliness and Tardiness Penalties with a Given Common Due Date
碩士 === 國立中央大學 === 工業管理研究所 === 93 === This study deals with the two-machine flow shops scheduling problem with the consideration of earliness and tardiness penalties. There are multiple jobs with a given common due date to be scheduled. All jobs have equal earliness and tardiness weights, and the wei...
Main Authors: | Shih-Kai Hsu, 徐士凱 |
---|---|
Other Authors: | Gwo-Ji Sheen |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/86456208992008676701 |
Similar Items
-
Minimizing Tardiness Penalty Costs in Job Shop Scheduling Under Maximum Allowable Tardiness
by: Jae-Gon Kim, et al.
Published: (2020-11-01) -
Single machine scheduling to minimize job-dependent weighted earliness and tardiness penalties with distinct release dates
by: Jeou-jer Luo, et al.
Published: (2005) -
Minimizing Total Weighted Earliness-Tardiness Penalties for the Single Machine Scheduling Problem with Common Due Window
by: Meng-yu Lin, et al. -
Minimizing Total Weighted Earliness-Tardiness Penalties for the Single Machine Scheduling Problem with Common Due Window
by: meng-yu Lin, et al. -
Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval
by: Chinyao Low, et al.
Published: (2016-01-01)