Scheduling multioperation jobs on a single flexible machine

作者：Su Ling Huey^*; Chen Yu Hsi

来源：International Journal of Advanced Manufacturing Technology, 2009, 42(11-12): 1165-1174.

DOI：10.1007/s00170-008-1666-3

• Scheduling
• Maximum lateness
• Multioperation jobs
• Single machine
• Total completion time

The problem of scheduling n multioperation jobs on a single machine such as the flexible manufacturing system is considered. Each job comprises up to F operations, which belong to several distinct families, and a sequence-independent setup time is incurred whenever an operation is to be processed following an operation of a different family. A job completes when all of its operations have been processed. Two variants with maximum lateness and total completion time as optimality criterion are considered. The problems are denoted as 1 vertical bar s(f); assembly; GT vertical bar L(max) and 1 vertical bar s(f) = 1, assembly; GT, p(ij) = 0 or 1 vertical bar Sigma C(j). The decision is to sequence all the families in order to minimize the predefined criterion. This environment has a variety of real world applications such as flexible manufacturing systems scheduling and food industry scheduling. A heuristic is presented and a branch and bound is developed for benchmarking. Experimental results show that the heuristic provides good results and the branch and bound procedure is efficient. These results may narrow down the gap between easy and hard cases of the general problem.

• 出版日期2009-6