Logistics is an important part of the supply chain and connect all aspects of the supply chain throughout it, which has become business cooperation ties. In the process of developing supply chain logistics strategy, g...Logistics is an important part of the supply chain and connect all aspects of the supply chain throughout it, which has become business cooperation ties. In the process of developing supply chain logistics strategy, generally require attention to the following questions： To segment customers, we should determine the appropriate level of customer service, such as order cycle, inventory levels and other modes of transport for different types of clients; Group products according to sales on them, we can take different strategies for each category of products. Order entry, order execution and delivery job processing accounted for a large proportion of logistics activities, which requires technology and management to make the entire processes of supply chain logistics more efficient, especially for the interface area between members of enterprises. We can eliminate redundant work by integrating flow, improve logistics efficiency.展开更多
This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer...This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it.展开更多
文摘Logistics is an important part of the supply chain and connect all aspects of the supply chain throughout it, which has become business cooperation ties. In the process of developing supply chain logistics strategy, generally require attention to the following questions： To segment customers, we should determine the appropriate level of customer service, such as order cycle, inventory levels and other modes of transport for different types of clients; Group products according to sales on them, we can take different strategies for each category of products. Order entry, order execution and delivery job processing accounted for a large proportion of logistics activities, which requires technology and management to make the entire processes of supply chain logistics more efficient, especially for the interface area between members of enterprises. We can eliminate redundant work by integrating flow, improve logistics efficiency.
基金National Nature Science Foundation of China under Grant Nos.11471210and 11171207the Natural Science Foundation of Ningbo City under Grant No.2015A610168the Natural Science Foundation of Zhejiang Province of China under Grant No.LQl3A010010
文摘This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it.
