Reducing efficiently the search tree for multiprocessor job-shop scheduling problems

The multiprocessor job-shop scheduling problem (JSP) is a generalisation of the classical job-shop problem, in which each machine is replaced by a group of parallel machines. We consider the most general case when the parallel machines are unrelated, where the number of feasible solutions grows dras...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2013-11, Vol.51 (23-24), p.7105-7119
Main Authors: Carballo, Lester, Vakhania, Nodari, Werner, Frank
Format: Article
Language:English
Subjects:
branch-and-bound algorithm
dominance relations
Heuristic
HTML
Java (programming language)
job shop scheduling
Job shops
Lower bounds
Mathematical models
Mathematical problems
Multiprocessing
Multiprocessor
Production scheduling
Reduction
Servers (computers)
Solution space
solution tree
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!