In the pallet pool system, the differentiation of palletized freight volumes in different regions and seasonal transport of certain goods lead to the imbalance of pallets distribution among regions. It is necessary to...In the pallet pool system, the differentiation of palletized freight volumes in different regions and seasonal transport of certain goods lead to the imbalance of pallets distribution among regions. It is necessary to improve the utilization of pallets through dispatching. The paper analyzes the factors which affect empty pallets dispatching, it includes carbon emission, transportation time and pallet type based on the pallet pool mode of enterprise alliance. On this basis, the optimization model is established with the goal of minimum total dispatching cost. Then, according to the different influences of railway and highway in transportation cost, the dispatching scheme is analyzed and the transportation mode of empty pallets dispatching is determined. Considering the characteristics of model, Cplex is used to solve it. Finally, a case is used to verify the feasibility and superiority of reasonable empty pallets dispatching in different transportation modes, and the transport characteristics of two transportation modes are analyzed. Moreover, the costs of pallets leasing and dispatching are compared.展开更多
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.展开更多
基金Supported by the National Natural Science Foundation of China(61374202)the “Fundamental Research Funds for the Central Universities”(2014YJS071)
文摘In the pallet pool system, the differentiation of palletized freight volumes in different regions and seasonal transport of certain goods lead to the imbalance of pallets distribution among regions. It is necessary to improve the utilization of pallets through dispatching. The paper analyzes the factors which affect empty pallets dispatching, it includes carbon emission, transportation time and pallet type based on the pallet pool mode of enterprise alliance. On this basis, the optimization model is established with the goal of minimum total dispatching cost. Then, according to the different influences of railway and highway in transportation cost, the dispatching scheme is analyzed and the transportation mode of empty pallets dispatching is determined. Considering the characteristics of model, Cplex is used to solve it. Finally, a case is used to verify the feasibility and superiority of reasonable empty pallets dispatching in different transportation modes, and the transport characteristics of two transportation modes are analyzed. Moreover, the costs of pallets leasing and dispatching are compared.
基金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.
