Skip navigation

Order assignment and scheduling under processing and distribution time uncertainty

Order assignment and scheduling under processing and distribution time uncertainty

Li, Yantong, Cote, Jean-Francois, Coelho, Leandro, Zhang, Chuang and Zhang, Shuai ORCID: 0000-0002-9796-058X (2022) Order assignment and scheduling under processing and distribution time uncertainty. European Journal of Operational Research, 305 (1). pp. 148-163. ISSN 0377-2217 (Print), 1872-6860 (Online) (doi:https://doi.org/10.1016/j.ejor.2022.05.033)

[img]
Preview
PDF (AAM)
36364_ZHANG_Distributed_order_assignment.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (392kB) | Preview

Abstract

In response to increasingly fierce competition and highly customized demands, many companies adopt a distributed production model but manage their orders in a centralized manner. Coordination between multiple factories requires unified information and resources to provide a close match between supply and demand. One of the crucial tasks is to solve the order assignment and scheduling (OAS) problem with uncertainties introduced by unexpected changes in upstream supply, labor supply, and transportation capacity. Managing uncertainties in production and distribution is important, as they can significantly interrupt and delay the timely and constant supply of orders if not appropriately managed. We address an order assignment and scheduling problem with direct distribution under uncertainties in processing and distribution time. The aim is to achieve a minimum of weighted sum cost and timeliness, which involves the optimization of the order assignments to multi-factory and production scheduling for orders at each site. We first formulate the problem as a two-stage stochastic programming model. To manage a large scale of possible scenarios, we apply a sample average approximation (SAA) method to approximate the model. We propose a novel model with fewer binary variables and big-M constraints. An exact logic-based Benders decomposition (LBBD) method is developed to deal with practical-sized instances. Numerical results indicate the superiority of our new model and the LBBD method. Managerial implications are discussed to demonstrate its advantages and potential applicability in practice.

Item Type: Article
Uncontrolled Keywords: order assignment and scheduling; stochastic optimization; makespan; tardiness; logic-based Benders decomposition
Subjects: H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
H Social Sciences > HD Industries. Land use. Labor > HD61 Risk Management
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group: Faculty of Business
Faculty of Business > Department of Systems Management & Strategy
Last Modified: 21 May 2024 01:38
URI: http://gala.gre.ac.uk/id/eprint/36364

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics