Abstract
The flow shop scheduling problem (FSSP) with limited buffers constraint is a typical NP-hard combinatorial optimization problem and represents an important area in production scheduling. In this paper, a class of differential evolution (DE) method with the optimal computing budget allocation (OCBA) technique and hypothesis test (HT), namely OHTDE, is proposed for the stochastic flow shop scheduling with limited buffers between consecutive machines to minimize the maximum completion time (i.e., makespan). In the OHTDE, the population-based search mechanism of DE and a special crossover are applied for well exploration and exploitation, and the OCBA technique is used to allocate limited sampling budgets to provide reliable evaluation and identification for good individuals. Meanwhile, HT is also applied to perform a statistical comparison to avoid some repeated search to some extent. The results and comparisons demonstrate the superiority of OHTDE in terms of effectiveness and robustness.
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.
