Single Machine Scheduling Problem with Different Job Release Times

• Main Authors: Tzu-Yun Chang, 張子筠
• Other Authors: Ching-En Lee
• Format: Others
• Language: en_US
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/75616561766675789116

博士 === 國立交通大學 === 工業工程與管理系 === 92 === In an increasingly competitive environment, meeting due date is one of the most important issues that firms need to consider. It is commonly known that when tardy jobs arise, a company may incur tardiness costs, reduce the goodwill and lose future sales. In practice, a firm may give customers different weights of importance, depending on the criteria such as the length of business activities in-between, the frequency with which a customer provides business to the firm, the average percentage of the firm’s capacity filled by a customer’s orders, and the potential of a customer to put orders in the future. The weights of importance often decide the priorities of the customers’ orders in production. What management should do is to minimize the weighted tardiness and the accompanied cost. In this research, heuristic algorithms are proposed to solve the dynamic single machine scheduling problems. The objective is to minimize the total weighted tardiness. There are two sub-problems discussed here. One is to solve the single machine scheduling problem with different jobs release times. The other is to solve the single machine scheduling problem characterized by different job release dates and sequence-dependent setup times. Mathematical programming with logical constraints models are employed to validate the performance of these heuristics. Computational results show that these heuristic scheduling algorithms are practical to solve real word applications.