Title of article
Lower bounds for the job-shop scheduling problem on multi-purpose machines Original Research Article
Author/Authors
Bernd Jurisch، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
12
From page
145
To page
156
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.
Keywords
Job-shop scheduling , Lower bound , Shortest path problem with obstacles , Multi-purpose machines
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884194
Link To Document