Abstract
Supply chain-oriented scheduling problems have received recent recognition among production research scholars due to their ability in integrating production planning and control across manufacturing systems. This study contributes to the literature of the distributed scheduling problems developing an original Mixed-Integer Linear Programming (MILP) formulation to the Distributed Two-Stage Assembly Flowshop Scheduling Problem with Sequence-Dependent Setup Times (DTSAFSP-SDSTs). Besides, the Iterated Greedy algorithm is extended to effectively solve this relatively complex production scheduling situation considering the makespan as the optimization criterion. Extensive numerical tests and statistical analyses are conducted to evaluate the effectiveness of the developed solution algorithm. Results showed that the Improved Iterated Greedy (IIG) algorithm yields the best solution in nearly all of the large-scale instances. The statistical test of significance confirmed that IIG is superior to the current-best-performing algorithm. This study contributes to the transition from standalone optimization to integrated production planning and control of distributed manufacturing systems.
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.
