A GENERAL METHOD FOR MACHINE SCHEDULING

1 January 1968

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 7 (3) , 207-217
https://doi.org/10.1080/00207546808929811

Abstract

Some problems involving the allocation of jobs to machines and the sequencing of jobs on machines are reviewed. Attention is drawn to their underlying relationships and in particular to their representation in terms of a process graph. A method of solution for a wide variety of such problems is proposed, which uses the branch and bound technique and the process graph representation. The solution of an assembly line balancing problem is illustrated and a limited comparison with other published methods is given.

Keywords

This publication has 8 references indexed in Scilit:

Discrete Programming by the Filter Method
Operations Research, 1967
Branch-and-Bound Methods: A Survey
Operations Research, 1966
A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem
Journal of the Operational Research Society, 1965
An Algorithm for the Line Balancing Problem
Management Science, 1964
An Algorithm for the Traveling Salesman Problem
Operations Research, 1963
Assembly-Line Balancing by Linear Programming
Operations Research, 1960
On the Job-Shop Scheduling Problem
Operations Research, 1960
On the Shortest Route Through a Network
Management Science, 1960