Abstract
This paper intends to address the distributed flexible job shop scheduling problem (DFJSP) with minimizing maximum completion time (makespan). In order to solve this problem, we propose four mixed integer linear programming (MILP) models as well as a constraint programming (CP) model, among which four MILP models are formulated based on four different modeling ideas. MILP models are effective in solving small-scaled problems to optimality. DFJSP is NP-hard, therefore, we propose an efficient constraint programming (CP) model based on interval decision variables and domain filtering algorithms. Numerical experiments are conducted to evaluate the performance of the proposed MILP models and CP model. The results show that the sequence-based MILP model is the most efficient one, and the proposed CP model is effective in finding good quality solutions for the both the small-sized and large-sized instances. The CP model incomparably outperforms the state-of-the-art algorithms and obtains new best solutions for 11 benchmark problems. Moreover, the best MILP model and CP model have proved the optimality of 62 best-known solutions.
Published Version
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.
