Finding Semi-Active Schedules for Job Shop Scheduling Problem with Minimum and Maximum Time Lags

• Main Authors: Chih-chou Yeh, 葉秩州
• Other Authors: Gwo-ji Sheen
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/69318980755857467935

碩士 === 國立中央大學 === 工業管理研究所 === 102 === We consider the job shop scheduling problem with minimum and maximum time lags while minimizing the makespan. This problem typically arises in a manufacturing environment where the next operation has to be carried out within a specific time range after the completion of the immediately preceding operation. This type of temporal constraints occurs in practical applications such food production, chemical production and steel production. We describe a branch and bound algorithm, based on the input and output of given clique, a concept first proposed by Carlier and Pinson (1989), and the relevant propositions adopted from Sheen and Liao (2007), for finding the optimal waiting times. For enumerating the solutions efficiently, we incorporate the branching scheme form Giffler and Thompson (1960) and Carlier and Pinson (1989) to generate semi-active schedules for the job shop scheduling problem with minimum and maximum time lags. In the computational experiments, we generate scenarios to showing we can either find an optimal schedule or establish the infeasibility in different waiting time ranges.