Abstract
An integrated scheduling problem of supply and distribution operations in a make-to-order supply chain is considered. The supply chain consists of contracted suppliers, capacitated processing centers, and many demand points. Processing centers customize and/or configure semi-finished products supplied by suppliers to finished products in terms of the requirements of demand points: order quantity and delivery deadline. The problem is to find the assignment of both suppliers and demand points to processing centers and the schedules for supply and distribution operations such that the total costs of shipping and penalty that unfulfilled customer orders incur are minimized, subject to network capacity and deadline constraints. In this paper, a heuristic algorithm is developed, based on partial relaxation and median threshold, which makes it possible to avoid dealing with the generalized assignment problem, a strongly NP-hard problem, in the solution process. Computational tests are performed over test cases randomly generated to assess the performance of the proposed algorithm. As compared to the use of commercial optimization package, CPLEX, computational results show that the proposed algorithm is able to find a good near-optimal solution to this problem with remarkably less computational time.
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.
