Makespan minimization with OR-precedence constraints
Makespan minimization with OR-precedence constraints
About this item
Full title
Author / Creator
Publisher
New York, NY: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York, NY: Springer US
Subjects
More information
Scope and Contents
Contents
We consider a variant of the NP-hard problem of assigning jobs to machines to minimize the completion time of the last job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its predecessors to be completed before it can start. In this paper, we consider a different type of precedence relatio...
Alternative Titles
Full title
Makespan minimization with OR-precedence constraints
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2545289711
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2545289711
Other Identifiers
ISSN
1099-1425,1094-6136
E-ISSN
1099-1425
DOI
10.1007/s10951-021-00687-6
