Abstract
This paper considers the flexible job-shop scheduling problem with stochastic processing times. Contrary to the classical criteria in the literature used to deal with random parameters, the probability of the makespan to be smaller than a predefined value, called makespan service level, is maximized. A tabu search approach combined with a Monte Carlo sampling method is proposed. Computational experiments are conducted on extended versions of benchmark instances, including the probabilistic description of random parameters. The numerical results illustrate the impact of key characteristics of the proposed approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
