Lower bounds for the job-shop scheduling problem on multi-purpose machines

Abstract

The job-shop problem on multi-purpose machines (MPM job-shop problem) arises in the area of flexible manufacturing systems. It is a generalization of the classical job-shop scheduling problem. We develop a lower bound for the MPM job-shop problem. It is based on a two-job relaxation which can be solved efficiently by using geometric methods. © 1995.