Accession Number : AD0755470

Title :   On the Scheduling of Jobs on a Number of Identical Machines.

Descriptive Note : Research rept.,

Corporate Author : NORTH CAROLINA STATE UNIV RALEIGH DEPT OF INDUSTRIAL ENGINEERING

Personal Author(s) : Elmaghraby,Salah E. ; Park,Sung H.

Report Date : 01 DEC 1972

Pagination or Media Count : 36

Abstract : Several theoretical results are developed to obtain an efficient branch-and-bound algorithm for the sequencing problem when all jobs are available to process at time zero and are independent (i.e., there are no precedence relationships among jobs). The branch-and-bound algorithm and its computational results are given for the case of linear penalty functions. The computational experiences are very encouraging. The computer times required to solve the problems are very short and most problems become optimal at the early stages of computation. (Author)

Descriptors :   (*SCHEDULING, *MACHINE SHOP PRACTICE), SEQUENCES(MATHEMATICS), MACHINES, PRODUCTION CONTROL, PERMUTATIONS, ALGORITHMS, COMPUTER PROGRAMMING, LINEAR PROGRAMMING, MATHEMATICAL MODELS

Subject Categories : Operations Research
      Mfg & Industrial Eng & Control of Product Sys

Distribution Statement : APPROVED FOR PUBLIC RELEASE