Multi-objective single machine scheduling with respect to flow time and the number of early jobs

• Main Authors: Ko-Hsun Hu, 胡可勳
• Other Authors: Rong-hwa Huang
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/70366575715551534452

碩士 === 輔仁大學 === 管理學研究所 === 94 === Scheduling deals with the allocation of resource to arrange over time. It is a decision-making process with the goal of optimizing one or more objectives. Effective sequencing and scheduling has become a necessity for survival in the current competitive environment. In this paper we study the properties of efficient schedules with respect to flow time and the number of tardy jobs. Minimizing the flow time implies minimizing work-in-process inventory. On the other hand, minimizing the number of early can be considered as a measure of customer’s concerns. Therefore, we included measure representing both the manufacture’s and customer’s concerns. Hence we develop new theorems, that can be used to reduce the problem size and eliminate inferior schedules. Some properties identify the job which can be sequenced last in an efficient schedule. Other properties of efficient solutions are also discussed.