Single machine scheduling problem－considering the earliness-tardiness penalty and delivery cost

• Main Authors: Yow-ru Wang, 汪祐如
• Other Authors: Yar-Lin Kuo
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/15868965853832771694

碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 94 === For manufacturing industry, the order begins from the moment that the factory gets it, then proceeds to production and ends when the comapany deliver the goods to customers. When we consider the scheduling problem, we should consider scheduling of order processing and scheduling of order delivery in the same time. But the two parts do not independent, it means when we decide one of them that will be affect the other one. WTO opens globalization market competiton. Cooperating with other countries is more frequently and delivery cost takes a bigger part in the cost structure. Single customer may asks different due date with different jobs. In order to reduce delivery cost、satisfy the due date and consider earliness penalty, so we should think the scheduling of order processing and scheduling of order delivery in the same time. Our research sets up a model that integrates order schedule and delivery schedule, by mathematic programming at first. But the problem is a NP-hard, computation time increases exponentially as number of orders grows. So our research develops methods of two stages and delivery algorithm. And by the results of experiment, our methods could solve the problem with abundance of orders in shorter time and the solutions are close to optimal.