《1991 A branch and bound algorithm for job-shop scheduling》.pdf

J.K.A. U.: Sci.,vol. 3, pp. 201-2(1)(1411A.H./1991 A.D. A Branch and Bound Algorithm for Job-Shop Scheduling A.M.A. HARIRI and C.N. Pons Department of Statistics,Facultyof Science, King Abdulaziz University,Jeddah,SaudiArabia and Facultyof Mathematical Studies, Universityof Southampton,U.K. ABSTRACf. The problem of scheduling jobs in a general job-shop to minimize the maximum completion time is considered. A branch and bound algorithm is proposed. The lower bound is obtained from the preemptive scheduleswhich fqrm solutionsof single machinesubproblems. In the branching rule, a set of operations which each require the same machine is selected and branchesof the searchtree corresponding to the possibilities that an operation of this set is sequencedbefore (or after) the others. Computational experience with a variety of test problems is re- ported. . Introduction In the job-shop problem, there are mmachines (numbered 1,... , m) which are used to processnjobs (numbered 1, ..., n). Eachmachine canhandle at mostOnejob at a time. Job i( i = 1,,.; , n) consistsof a sequenceof operations Oil ..., °iniwhich are to be performed on machinesmil ...,min- and which require positive processing timesPil ...Pin- respectively. Processingstarts attime zero. There are technological constraintswhich specifythat operation o ijcannot start until o ij-I iscompleted (i = 1, ...,11.,j = 2, ..., ni) Preemptionof