This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. Finally, the proposed solution approach is tested on several examples derived from a real-world case study arising in a company that builds vessels for the offshore oil and gas industry.
引用
收藏
页码:943 / 948
页数:6
相关论文
共 6 条
[1]
[Anonymous], 2016, SCHEDULING THEORY AL, DOI DOI 10.1007/978-3-319-26580-3