Research On Flow Shop Scheduling With Human-machine Resource Constraints And Optimization Algorithms

The classical flow shop scheduling problem only considers machine resources but not the impact of worker resources.And machine resources are assumed to be always available.In practice,machines cannot always be in normal state due to machine life,failure and maintenance.However,both machine resources and worker resources,as two important factors in the production process,directly affect the production efficiency of enterprises.Therefore,we study the influence of human-machine resource constraints on flow shop scheduling from two aspects of worker resources and machine maintenance,The study aims to construct two flow shop scheduling models corresponding to real-world production and develop efficiency algorithms.The main researches include:(1)The hybrid flow shop scheduling problem with worker resource constraints(HFSSW)is presented by constructing its mixed integer linear programming model.Based on list scheduling and the earliest expiration date rule(EDD),we develop seven heuristic decoding methods,which are respectively integrated into a multi-objective evolutionary algorithm for seven multi-objective evolutionary algorithm with heuristic decoding(MOEAH)to solve HFSSW.Then,the computational experiments show that the proposed MOEAH is more efficient than the mixed linear integer programming model and two popular algorithms,and EDD can enhance the performance of the heuristic decoding.(2)A two-machine flow shop scheduling problem with position-dependent maintenance constraints(TMSSPM)is designed and a heuristic solution algorithm is analyzed.In the classical two-machine flow shop scheduling,a single position-related maintenance is considered on machines,which is categorized into three cases: a position-related maintenance on the first machine,a position-related maintenance on the second machine and a position-related maintenance on both machines.First,a mixed linear integer programming model of TMSSPM is constructed,and then the optimal solution characteristics of TMFSSPM are pointed out.By transforming TMSSPM into a two-partition problem,the scheduling problem is proved to be an NP-hard problem,and a heuristic algorithm HJA is proposed based on the Johnson rule algorithm,whose the worst performance ratio for TMSSPM is 2.(3)Based on the research of flow shop scheduling with human-machine resources constraints,Int Schedule,a desktop application for flow shop scheduling,was designed and developed.Qt was selected as the development environment,and some flow shop scheduling problems with and without human-machine resource constraints were realized in a modular manner.Under each module,it is possible to solve existing scheduling instances and customized scheduling problems.The information interaction is executed by the user operation interface in each module,and then solve the input scheduling problem by the scheduling calculation engine in Int Schedule.Finally,the scheduling results are showed by the Gantt chart,scheduling solution and solution objectives.