arrow
返回

Order assignment and scheduling under processing and distribution time uncertainty

delete2023-02-01
delete13
delete
OA
AI
李延通 封面图
李延通 (Yantong Li) *
J
Jean‐François Côté
L
Leandro C. Coelho
C
Chuang Zhang
S
Shuai Zhang
DOI:10.1016/j.ejor.2022.05.033delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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 problem with un-certainties introduced by unexpected changes in upstream supply, labor supply, and transportation capac-ity. 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 distri-bution 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 Ben-ders 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. (c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Order assignment and scheduling
Stochastic optimization
Makespan
Tardiness
Logic-based Benders decomposition
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

U
universite de montreal
学者数:
4.6W
论文数: 3.8W
被引数: 46
L
laval university
学者数:
2.5W
论文数: 2.2W
被引数: 96
U
University of Greenwich
学者数:
2.9K
论文数: 3.2K
被引数: 4.3K
D
Dalian Maritime University
学者数:
1.2W
论文数: 7.9K
被引数: 6.3K
学者 查看更多机构
引用论文

引用论文

Towards certain fixes with editing rules and master data
err2010-09-01
err0
PREAI
errWenfei Fan; Jianzhong Li; Shuai Ma; Nan Tang; Wenyuan Yu
err分享
err收藏
学者 查看更多内容