Author
Listed:
- Gabriel Mauricio Zambrano-Rey
(Pontificia Universidad Javeriana)
- Eliana María González-Neira
(Pontificia Universidad Javeriana)
- Gabriel Fernando Forero-Ortiz
(Pontificia Universidad Javeriana)
- María José Ocampo-Monsalve
(Pontificia Universidad Javeriana)
- Andrea Rivera-Torres
(Pontificia Universidad Javeriana)
Abstract
This paper addresses a stochastic job shop scheduling problem with sequence-dependent setup times, aiming to minimize the expected maximum lateness. The stochastic nature is modeled by considering uncertain times between failures (TBF) and uncertain times to repair (TTR). To tackle this problem, a simheuristic approach is proposed, which combines a tabu search (TS) algorithm with Monte Carlo simulation. A total of 320 instances were used to conduct multiple experiments. Instances were generated with two distributions to study the behavior of stochastic TTR and TBF under log-normal and exponential distributions. Firstly, the performance of the simheuristic was evaluated for small instances by comparing it with the simulation of optimal solutions obtained with a mixed-integer linear programming (MILP) model. The simheuristic approach demonstrated an average improvement of around 7% compared to the simulation of MILP model solutions. Secondly, the simheuristic performance was evaluated for medium and large-size instances by comparing it with the simulation of the solutions obtained by the earliest due date (EDD) and process time plus work in the next queue plus negative slack (PT + WINQ + SL) dispatching rules. The results showed an average improvement of around 11% compared to EDD and 14% compared to PT + WINQ + SL. Furthermore, the results highlight that even when the two distributions have the same expected value and coefficient of variation, they can yield different expected maximum lateness values. This emphasizes the importance of precise distribution fitting when solving real cases to achieve effective scheduling performance.
Suggested Citation
Gabriel Mauricio Zambrano-Rey & Eliana María González-Neira & Gabriel Fernando Forero-Ortiz & María José Ocampo-Monsalve & Andrea Rivera-Torres, 2024.
"Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns,"
Annals of Operations Research, Springer, vol. 338(1), pages 801-833, July.
Handle:
RePEc:spr:annopr:v:338:y:2024:i:1:d:10.1007_s10479-023-05592-z
DOI: 10.1007/s10479-023-05592-z
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:338:y:2024:i:1:d:10.1007_s10479-023-05592-z. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.