IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v350y2025i3d10.1007_s10479-016-2254-9.html
   My bibliography  Save this article

Stochastic customer order scheduling to minimize long-run expected order cycle time

Author

Listed:
  • Xiaoyun Xu

  • Yaping Zhao
  • Manxi Wu
  • Zihuan Zhou
  • Ying Ma
  • Yanni Liu

Abstract

This study considers a dynamic customer order scheduling problem in stochastic setting. Customer orders arrive at the machine station dynamically according to a Poisson process. Each order consists of multiple product types with random workloads. Each order’s workloads will be assigned to and processed by a set of unrelated parallel machines. The objective is to determine the optimal workload assignment which minimizes the long-run expected order cycle time. Through the Fork–Join queue model, a lower bound on the objective function is established by stochastically comparing the original system to other queueing systems with less complex service structures. This proposed lower bound is proved to be equal to the optimal objective value in two important sub-classes of the problem. Inspired by the design of the lower bound, three polynomial-time heuristic algorithms are proposed. The effectiveness of the lower bound and the scheduling heuristics is demonstrated through computational experiment. This study brings new perspective to the stochastic modeling of the order scheduling problem and suggests ways to enhance the effectiveness of various managerial options for improving production efficiency.

Suggested Citation

  • Xiaoyun Xu & Yaping Zhao & Manxi Wu & Zihuan Zhou & Ying Ma & Yanni Liu, 2025. "Stochastic customer order scheduling to minimize long-run expected order cycle time," Annals of Operations Research, Springer, vol. 350(3), pages 1283-1306, July.
    • Handle: RePEc:spr:annopr:v:350:y:2025:i:3:d:10.1007_s10479-016-2254-9
    DOI: 10.1007/s10479-016-2254-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2254-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2254-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Milorad Vidovic & Kap Kim, 2006. "Estimating the cycle time of three-stage material handling systems," Annals of Operations Research, Springer, vol. 144(1), pages 181-200, April.
    2. Leung, Joseph Y.-T. & Li, Haibing & Pinedo, Michael, 2006. "Scheduling orders for multiple product types with due date related objectives," European Journal of Operational Research, Elsevier, vol. 168(2), pages 370-389, January.
    3. Nicholas Hall & Chelliah Sriskandarajah & Tharmarajah Ganesharajah, 2001. "Operational Decisions in AGV-Served Flowshop Loops: Scheduling," Annals of Operations Research, Springer, vol. 107(1), pages 161-188, October.
    4. Reza Ahmadi & Uttarayan Bagchi & Thomas A. Roemer, 2005. "Coordinated scheduling of customer orders for quick response," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 493-512, September.
    5. James D. Blocher & Dilip Chhajed, 1996. "The customer order lead‐time problem on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 629-654, August.
    6. Wang, Guoqing & Cheng, T.C. Edwin, 2007. "Customer order scheduling to minimize total weighted completion time," Omega, Elsevier, vol. 35(5), pages 623-626, October.
    7. Lee, Ik Sun, 2013. "Minimizing total tardiness for the order scheduling problem," International Journal of Production Economics, Elsevier, vol. 144(1), pages 128-134.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    2. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    3. Framinan, Jose M. & Perez-Gonzalez, Paz, 2018. "Order scheduling with tardiness objective: Improved approximate solutions," European Journal of Operational Research, Elsevier, vol. 266(3), pages 840-850.
    4. Ren-Xia Chen & Shi-Sheng Li, 2020. "Minimizing maximum delivery completion time for order scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1044-1064, November.
    5. Joseph Leung & Haibing Li & Michael Pinedo, 2008. "Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time," Annals of Operations Research, Springer, vol. 159(1), pages 107-123, March.
    6. Jian Chen & Meilin Wang & Xiang T. R. Kong & George Q. Huang & Qinyun Dai & Guoqiang Shi, 2019. "Manufacturing synchronization in a hybrid flowshop with dynamic order arrivals," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2659-2668, October.
    7. T.C. Edwin Cheng & Qingqin Nong & Chi To Ng, 2011. "Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 763-770, December.
    8. Lee, Ik Sun, 2013. "Minimizing total tardiness for the order scheduling problem," International Journal of Production Economics, Elsevier, vol. 144(1), pages 128-134.
    9. Yadong Wang & Baoqiang Fan & Jingang Zhai & Wei Xiong, 2019. "Two-machine flowshop scheduling in a physical examination center," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 363-374, January.
    10. Grzegorz Bocewicz & Zbigniew Banaszak & Izabela Nielsen, 2019. "Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints," Annals of Operations Research, Springer, vol. 273(1), pages 561-585, February.
    11. Xiaoju Zhang & Yue Gu & Yuqing Yang & Baoli Liu, 2023. "Comparing the Efficiency of Two Types of Yard Layout in Container Terminals," Sustainability, MDPI, vol. 15(9), pages 1-18, April.
    12. Arsham, Hossein & Adlakha, Veena & Lev, Benjamin, 2009. "A simplified algebraic method for system of linear inequalities with LP applications," Omega, Elsevier, vol. 37(4), pages 876-882, August.
    13. Chen, Lu & Langevin, André & Lu, Zhiqiang, 2013. "Integrated scheduling of crane handling and truck transportation in a maritime container terminal," European Journal of Operational Research, Elsevier, vol. 225(1), pages 142-152.
    14. Chelliah Sriskandarajah & Inna Drobouchevitch & Suresh P. Sethi & Ramaswamy Chandrasekaran, 2004. "Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot," Operations Research, INFORMS, vol. 52(1), pages 65-82, February.
    15. Zhang, Xiaoju & Zeng, Qingcheng & Sheu, Jiuh-Biing, 2019. "Modeling the productivity and stability of a terminal operation system with quay crane double cycling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 181-197.
    16. Amogh Bhosekar & Sandra Ekşioğlu & Tuğçe Işık & Robert Allen, 2023. "A discrete event simulation model for coordinating inventory management and material handling in hospitals," Annals of Operations Research, Springer, vol. 320(2), pages 603-630, January.
    17. Fernandez-Viagas, Victor & Talens, Carla & Framinan, Jose M., 2022. "Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 869-882.
    18. Julius Hoffmann & Janis S. Neufeld & Udo Buscher, 2024. "Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment," Journal of Scheduling, Springer, vol. 27(6), pages 525-543, December.
    19. Asef-Vaziri, Ardavan & Laporte, Gilbert, 2005. "Loop based facility planning and material handling," European Journal of Operational Research, Elsevier, vol. 164(1), pages 1-11, July.
    20. Lin, B.M.T. & Kononov, A.V., 2007. "Customer order scheduling to minimize the number of late jobs," European Journal of Operational Research, Elsevier, vol. 183(2), pages 944-948, December.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:350:y:2025:i:3:d:10.1007_s10479-016-2254-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.