Electronic Resource
Springer
Journal of global optimization
9 (1996), S. 293-320
ISSN:
1573-2916
Keywords:
Scheduling
;
Routing
;
Network
;
Flow Shops
;
Heuristics
;
Error Bounds
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We consider the general problem of static scheduling of a set of jobs in a network flow shop. In network flow shops, the scheduler not only has to sequence and schedule but also must concurrently determine the process routing of the jobs through the shop. In this paper, we establish the computational complexity of this new class of scheduling problem and propose a general purpose heuristic procedure. The performance of the heuristic is analyzed when makespan, cycle time and average flow time are the desired objectives.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00121676
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |