A multi-shop integrated scheduling algorithm with fixed output constraint
Authors:
- 19 February 2021
- journal article
- research article
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 41 (3) , 4609-4617
Abstract
The customized products such as electromechanical prototype products are a type of product with research and trial manufacturing characteristics. The BOM structures and processing parameters of the products vary greatly, making it difficult for a single shop to meet such a wide range of processing parameters. For the dynamic and fuzzy manufacturing characteristics of the products, not only the coordinated transport time of multiple shops but also the fact that the product has a designated output shop should be considered. In order to solve such Multi-shop Integrated Scheduling Problem with Fixed Output Constraint (MISP-FOC), a constraint programming model is developed to minimize the total tardiness, and then a Multi-shop Integrated Scheduling Algorithm (MISA) based on EGA (Enhanced Genetic Algorithm) and B&B (Branch and Bound) is proposed. MISA is a hybrid optimization method and consists of four parts. Firstly, to deal with the dynamic and fuzzy manufacturing characteristics, the dynamic production process is transformed into a series of time-continuous static scheduling problem according to the proposed dynamic rescheduling mechanism. Secondly, the pre-scheduling scheme is generated by the EGA at each event moment. Thirdly, the jobs in the pre-scheduling scheme are divided into three parts, namely, dispatched jobs, jobs to be dispatched, and jobs available for rescheduling, and at last, the B&B method is used to optimize the jobs available for rescheduling by utilizing the period when the dispatched jobs are in execution. Google OR-Tools is used to verify the proposed constraint programming model, and the experiment results show that the proposed algorithm is effective and feasible.Keywords
This publication has 14 references indexed in Scilit:
- Flexible flow shop with dedicated buffersDiscrete Applied Mathematics, 2019
- Multi-batch integrated scheduling algorithm based on time-selectiveMultimedia Tools and Applications, 2018
- Time‐selective integrated scheduling algorithm with backtracking adaptation strategyExpert Systems, 2018
- Integrated scheduling algorithm based on an operation relationship matrix table for tree-structured productsInternational Journal of Production Research, 2018
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterionInternational Journal of Mathematics in Operational Research, 2017
- Mixed Integer Programming models for job shop scheduling: A computational analysisComputers & Operations Research, 2016
- A multi-objective teaching−learning-based optimization algorithm to scheduling in turning processes for minimizing makespan and carbon footprintJournal of Cleaner Production, 2015
- Hybrid teaching–learning-based optimization algorithms for the Quadratic Assignment ProblemComputers & Industrial Engineering, 2015
- A new algorithm for complex product flexible scheduling with constraint between jobsComputers & Industrial Engineering, 2009
- Extending the shifting bottleneck procedure to real-life applicationsEuropean Journal of Operational Research, 1996