Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Job-shop scheduling with multi-purpose machines

Job-shop scheduling with multi-purpose machines 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computing Springer Journals

Job-shop scheduling with multi-purpose machines

Computing , Volume 45 (4) – Oct 17, 2005

Loading next page...
 
/lp/springer-journals/job-shop-scheduling-with-multi-purpose-machines-3iUT0kwhKE

References (6)

Publisher
Springer Journals
Copyright
Copyright © 1990 by Springer-Verlag
Subject
Computer Science; Computer Science, general; Information Systems Applications (incl.Internet); Computer Communication Networks; Software Engineering; Artificial Intelligence; Computer Appl. in Administrative Data Processing
ISSN
0010-485X
eISSN
1436-5057
DOI
10.1007/BF02238804
Publisher site
See Article on Publisher Site

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.

Journal

ComputingSpringer Journals

Published: Oct 17, 2005

There are no references for this article.