Abstract

This paper considers advanced planning and scheduling (APS) in which each customer order has a due date and outsourcing is available. We present a model for APS that requires an absolute due date with outsourcing in a manufacturing supply chain. In practice, planning and scheduling are interrelated and should be solved simultaneously with outsourcing to ensure that the due dates of customer orders are met. The proposed model considers alternative process plans for job types, with precedence constraints for job operations. Such a model has not been treated in the literature. The integrated states include: (a) selecting the best machine for each operation, (b) deciding the sequence of operations, (c) picking the operations to be outsourced, and (d) minimizing the makespan for the due date of each order. To solve the model, a genetic algorithm (GA)-based heuristic approach was developed. In numerical experiments, the GA-based approach efficiently solved the APS model, and produced the best process plans (operation sequence and machine selection with outsourcing) and schedules for all orders.

Full Text
Paper version not known

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.