Abstract

A sequential scheduling method for multi-objective, flexible job-shop scheduling problem (FJSP) work calendars is proposed. Firstly, the sequential scheduling problem for the multi-objective FJSP under mixed work calendars was described. Secondly, two key technologies to solve such a problem were proposed: one was a time-reckoning technology based on the machine’s work calendar, the other was a sequential scheduling technology. Then, a non-dominated sorting genetic algorithm with an elite strategy (NSGA-II) was designed to solve the problem. In the algorithm, a two-segment encoding method was used to encode the chromosome. A two-segment crossover and mutation operator were used with an improved strategy of genetic operators therein to ensure feasibility of the chromosomes. Time-reckoning technology was used to calculate start and end time of each process. The sequential scheduling technology was used to implement sequential scheduling. The case study shows that the proposed method can obtain an effective Pareto set of the sequential scheduling problem for multi-objective FJSP under mixed work calendars within an acceptable time.

Highlights

  • In recent years, researchers have shown an increased interest in the field of the flexible job-shop scheduling problem (FJSP), and there have been a large number of related research results

  • Work calendars. sorting algorithm, elite strategy, congestion degree and congestion degree comparison operator, it retains the best of all individuals in the offspring, which improves the precision of the optimization result, the operation speed and robustness of the algorithm

  • The case study shows that the speed of operation needs to be further increased, and Because non-dominated sorting genetic algorithm (NSGA)-II has a fast non-dominated sorting algorithm, elite strategy, congestion degree the calculation time is further reduced for actual production

Read more

Summary

Introduction

Researchers have shown an increased interest in the field of the flexible job-shop scheduling problem (FJSP), and there have been a large number of related research results. Most of the existing research results cannot be applied when mixed work calendars are considered. Because of the increasing pressure in manufacturing companies, more than one objective should be often considered in the process of production scheduling. Just for this reason, multi-objective optimization is more suitable for scheduling requirements. This work is called sequential scheduling in this paper. Based on the above reasons, the sequential scheduling for FJSP with multi-objectives under the mixed work calendars has become a new research topic

Objectives
Methods
Findings
Conclusion

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.