A robust basic cyclic scheduling problem
This paper addresses the Basic Cyclic Scheduling Problem where the processing times are affected by uncertainties. We formulate the problem as a two-stage robust optimization problem with a budgeted uncertainty set. More precisely, we consider the uncertainty set introduced by Bertsimas and Sim (Ope...
Saved in:
Main Authors: | , , |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2018
|
Subjects: | |
Online Access: | https://doaj.org/article/15acdbc9b02f4ffdb5ab61490b1f53a8 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!