Abstract
This study considers the necessity of hiring heterogeneous labors. So far, many studies focus more on manufacturing of equipment and control systems in the intelligent production planning. In fact, the regular labors’ processing time may be affected by the external factors and the disabled labors by the mentally handicapped. Therefore, this study sets the processing time of the two types of labors as fuzzy sets. The extra processing time from overtime generated by physical deterioration of old-aged labors is equal to the processing time of regular labors multiplied by the physical deterioration rate of old-aged labors on machine. The coefficient of the cost function is the stepwise function of cost structure. Besides, the dispatching rule based on floating time utilizes ant colony optimization to minimize the makespan. The data test results indicate that the proposed algorithm can efficiently dispatch and schedule the operations, with the average improvement ratio about 11.76%, and demonstrates high capability for the intelligent production planning
Highlights
Mathematical Problems in Engineering alternative production choice
The dispatching rule based on floating time utilizes ant colony optimization to minimize the makespan. us, Ant colony optimization (ACO) is proposed to solve this complex problem. is study applies an efficient dispatching rule, fuzzy processing time, and three heterogeneous labors using ACO to search for minimization of makespan
Conclusion is study examines the flexible flow shop scheduling problem, which is well-known for its strong NP-hard. e problem we study can be depicted as FFc|ZrijwWkMk, ZdijwWkMk, ZoijwWkMk, er, ed, eo|Cmax(er, ed, eo) · (Co· m − Sd · ed − So · eo)
Summary
As far as all the scheduling problems are concerned, flexible flow shop scheduling is seen as the most popular production condition in the real manufacturing industry, such as in the pharmaceutical factory, mouldmaking, steel mill, and accessories shop processing scenarios. Erefore, a multiobjective problem considering flexibility of job processing machines in a flexible flow shop (FFS) is considered using manufacturing simulation; results show the optimal resource assignment and optimal job sequence with efficiency and productivity. This method can minimize makespan, the number of late jobs, total flow time, and total weighted flow time in the flexible flow shop. Is study applies an efficient dispatching rule, fuzzy processing time, and three heterogeneous labors using ACO to search for minimization of makespan. The dispatching rule can prompt ants efficiently identify the route. is performance reinforces the solution capacity of ACO and outperforms most of trade-off problems for future studies
Sign-in/Register to view highlights & summary 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.
