We consider the problem of two-machine cross-docking flow shop scheduling where each job on the second machine cannot be processed unless a job or a set of jobs have been completed on the first machine.The aim is to f...We consider the problem of two-machine cross-docking flow shop scheduling where each job on the second machine cannot be processed unless a job or a set of jobs have been completed on the first machine.The aim is to find a feasible schedule that minimizes the makespan.As the problem is shown to be strongly NP-hard,we propose a genetic algorithm to solve small and large size problems.We test different types for each genetic operator where new ideas are introduced,which leads to propose six versions of the genetic algorithm.We then evaluate their effectiveness through an extensive computational experiments by using many instances generated randomly and by determining the percentage deviation from a lower bound from the literature.展开更多
文摘We consider the problem of two-machine cross-docking flow shop scheduling where each job on the second machine cannot be processed unless a job or a set of jobs have been completed on the first machine.The aim is to find a feasible schedule that minimizes the makespan.As the problem is shown to be strongly NP-hard,we propose a genetic algorithm to solve small and large size problems.We test different types for each genetic operator where new ideas are introduced,which leads to propose six versions of the genetic algorithm.We then evaluate their effectiveness through an extensive computational experiments by using many instances generated randomly and by determining the percentage deviation from a lower bound from the literature.
