Job-shop scheduling with multi-purpose machines |
| |
| Authors: | P. Brucker R. Schlie |
| |
| Affiliation: | 1. Fachbereich Mathematik/Informatik, Universit?t Osnabrück, Albrechtstrasse 28, D-4500, Osnabrück, Federal Republic of Germany
|
| |
| Abstract: | Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment μ of operations to machines letP(μ) be the corresponding job-shop problem andf(μ) be the minimum makespan ofP(μ). How to find an assignment which minimizesf(μ)? For problems with two jobs a polynomial algorithm is derived. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
