Abstract
In terms of characteristics of ∞exible job-shop scheduling problem, the complementary constraint models, including priority among difierent jobs and parent-child relations of relevant jobs, are established based on two objective function of minimizing makespan for all jobs and the sum of standard deviation of processing workload for all working centers. Aiming at the above model, a hybrid genetic annealing algorithm is proposed. The ∞ow and key technologies of algorithm, including chromosome encoding and decoding scheme, fltness function, selection operation, self-adaptive crossover and mutation operation, neighborhood structure design and acceptance criterion, cooling function, algorithm termination condition and parallel computation, are discussed in detail. The feasibility and validity of the proposed model and algorithm is demonstrated through computational experiment.
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.
