2017
DOI: 10.2139/ssrn.3052283
|View full text |Cite
|
Sign up to set email alerts
|

The Robust Machine Availability Problem

Abstract: We define and solve the robust machine availability problem in a parallel machine environment, which aims to minimize the number of identical machines required while completing all the jobs before a given deadline. Our formulation preserves a user-defined robustness level regarding possible deviations in the job durations. For better computational performance, a branch-andprice procedure is proposed based on a set covering reformulation. We use zero-suppressed binary decision diagrams (ZDDs) for solving the pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 70 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?