Abstract
Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic parallel machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.
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.
