Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Gerodimos (1996)
Robust Discrete Optimization and its ApplicationsJournal of the Operational Research Society, 49
R. Graham, E. Lawler, J. Lenstra, A. Kan (1977)
Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyAnnals of discrete mathematics, 5
J. Renegar (1988)
A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 40
E. Lawler, J. Labetoulle (1978)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJ. ACM, 25
P. Brucker, Bernd Jurisch, Andreas Krämer (1997)
Complexity of scheduling problems with multi-purpose machinesAnnals of Operations Research, 70
M. Espinouse, M. Jacomino, A. Rossi (2010)
The Robustness of Multi‐Purpose Machines Workshop Configuration
H. Yoon, D. Lee (2004)
Deadlock-free scheduling of photolithography equipment in semiconductor fabricationIEEE Transactions on Semiconductor Manufacturing, 17
A. Aubry, A. Rossi, M. Espinouse, M. Jacomino (2008)
Minimizing setup costs for parallel multi-purpose machines under load-balancing constraintEur. J. Oper. Res., 187
L. Snyder (2006)
Facility location under uncertainty: a reviewIIE Transactions, 38
Lhouari Nourine, Olivier Raynaud (1999)
A Fast Algorithm for Building LatticesInf. Process. Lett., 71
B. Penz, Christophe Rapine, D. Trystram (2001)
Sensitivity analysis of scheduling algorithmsEur. J. Oper. Res., 134
Stephen Wright (1997)
Primal-Dual Interior-Point Methods
J. Leung, Chung-Lun Li (2008)
Scheduling with processing set restrictions: A surveyInternational Journal of Production Economics, 116
J. Billaut, A. Moukrim, Éric Sanlaville (2008)
Flexibility and Robustness in Scheduling
Wu Zhi-ming (2008)
Deadlock-free Scheduling of Photolithography EquipmentMicrocomputer applications
E. Lawler, J. Labetoulle (1978)
On preemptive scheduling of unrelated parallel processors by linear programmingJournal of the Association for Computing Machinery, 25
Elif Akcalt, K. Nemoto, R. Uzsoy (2001)
Cycle-time improvements for photolithography process in semiconductor manufacturingIEEE Transactions on Semiconductor Manufacturing, 14
A. Aubry, A. Rossi, M. Jacomino (2008)
Sensitivity Analysis for the Configuration of a Multi-Purpose Machines WorkshopIFAC Proceedings Volumes, 41
(2009)
A generic off-line approach for dealing with uncertainty in optimisation
B. Tamm (1992)
International Federation of Automatic Control
A. Aubry, A. Rossi, M. Jacomino (2009)
Preprints of the 13th IFAC symposium on information control problems in manufacturing
P. Kouvelis, Abbas Kurawarwala, G. Gutierrez (1992)
Algorithms for robust single and multiple period layout planning for manufacturing systemsEuropean Journal of Operational Research, 63
G. Cho (2009)
A NEW PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR OPTIMIZATIONJournal of the Korean Society for Industrial and Applied Mathematics, 13
This paper addresses multi-purpose machine configuration in an uncertain context through sensitivity analysis. The so-called configuration is the machine’s ability to process products, and the uncertain context is modelled as a demand variation affecting the forecast demand. Given a configuration, this work aims at assessing the completion time deviation when the workshop demand is subject to perturbation. Such quantitative information can be used in a robustness approach for selecting the most appropriate configuration. To do so, the configuration impact on the completion time value that can be reached by solving the attached scheduling problem is first investigated. Then, the completion time deviation is written as a piecewise linear function of the magnitude of demand variation. The proposed approach, which is based on the solution of a set of linear programs, is illustrated through a detailed example. It is shown to be polynomial, and fast enough for addressing real-world instances. Finally, how to compare two configurations on the basis of completion time deviation in an uncertain context is demonstrated.
Annals of Operations Research – Springer Journals
Published: Oct 4, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.