An integrated model is presented to schedule the container handling system. The objective is to improve the coop- eration between different types of equipments, and to increase the productivity of the terminal. The pr...An integrated model is presented to schedule the container handling system. The objective is to improve the coop- eration between different types of equipments, and to increase the productivity of the terminal. The problem is formulated as a Hybrid Flow Shop Scheduling problem with precedence constraint, setup times and blocking (HFSS-B). A tabu search algorithm is proposed to solve this problem. The quality and efficiency of the proposed algorithm is analyzed from the computational point of view.展开更多
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 scheduling n jobs in a pallet-constrained flow shop so as to minimize the makespan.In such a flow shop environment,each job needs a pallet the entire time,from the start of its first operati...We consider the problem of scheduling n jobs in a pallet-constrained flow shop so as to minimize the makespan.In such a flow shop environment,each job needs a pallet the entire time,from the start of its first operation until the completion of the last operation,and the number of pallets in the shop at any given time is limited by a positive integer,K≤n.Generally speaking,the optimal schedules may be passing schedules.In this paper,we present a combinatorial property which shows that for two machines,K(K≥3）pallets,there exists a no-passing schedule which is an optimal schedule for n≤2K-1 and 2K-1 is tight.展开更多
文摘An integrated model is presented to schedule the container handling system. The objective is to improve the coop- eration between different types of equipments, and to increase the productivity of the terminal. The problem is formulated as a Hybrid Flow Shop Scheduling problem with precedence constraint, setup times and blocking (HFSS-B). A tabu search algorithm is proposed to solve this problem. The quality and efficiency of the proposed algorithm is analyzed from the computational point of view.
文摘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.
基金This author is supported by Netherlands organization for international cooperation in high education.
文摘We consider the problem of scheduling n jobs in a pallet-constrained flow shop so as to minimize the makespan.In such a flow shop environment,each job needs a pallet the entire time,from the start of its first operation until the completion of the last operation,and the number of pallets in the shop at any given time is limited by a positive integer,K≤n.Generally speaking,the optimal schedules may be passing schedules.In this paper,we present a combinatorial property which shows that for two machines,K(K≥3）pallets,there exists a no-passing schedule which is an optimal schedule for n≤2K-1 and 2K-1 is tight.
