scholarly journals Consolidation of Customer Orders into Truckloads at a Large Manufacturer

1997 ◽  
Vol 48 (8) ◽  
pp. 779 ◽  
Author(s):  
G. G. Brown ◽  
D. Ronen
2020 ◽  
Author(s):  
Gonçalo Figueira ◽  
Willem van Jaarsveld ◽  
Pedro Amorim ◽  
Jan C. Fransoo

Author(s):  
Albert Wee Kwan Tan ◽  
David Gligor

Omnichannel is an evolving business model that has been gaining increased popularity among retailers. This business model allows firms to use a variety of channels to interact with their customers and fulfill their orders. Customers can order online and pick up later in the store, or they can choose to have the products delivered from a nearby store. Due to the complexity of fulfilling customer orders via omnichannel models, positioning inventory is a key challenge in supporting this type of business model. This article presents a framework for assisting companies in deciding under what condition to centralize or decentralize their inventory to fulfill customer orders without disrupting the shopping experience.


2008 ◽  
Vol 48 (7-8) ◽  
pp. 1158-1169 ◽  
Author(s):  
Mehmet Aydinel ◽  
Taraneh Sowlati ◽  
Ximena Cerda ◽  
Eric Cope ◽  
Mats Gerschman

2021 ◽  
Vol 12 (3) ◽  
pp. 273-292 ◽  
Author(s):  
Ferda Can Çetinkaya ◽  
Pınar Yeloğlu ◽  
Hale Akkocaoğlu Çatmakaş

This study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order’s completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders’ total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times.


Sign in / Sign up

Export Citation Format

Share Document