Abstract

This paper considers the characteristics of a hybrid flow shop with JIT technical constraints. Lagrangian relaxation is presented to solve the Earliness/Tardiness problem in the hybrid flow-shop. By introducing precedence constraints into the objective function, the original problem is decomposed into a series of parallel machine sub-problems and a dynamic programming algorithm is designed to solve these sub-problems. Heuristic approach is further applied to convert the infeasible solution into a feasible solution. Testing results demonstrated that the proposed method can generate near optimal schedules in an acceptable computational time.

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 call

Disclaimer: 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.