IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v15y2025ics2214716025000387.html

Customer order scheduling in a permutation flow shop environment

Author

Listed:
  • Hoffmann, Julius
  • Neufeld, Janis S.
  • Buscher, Udo

Abstract

Various recent scheduling literature has studied the so called customer order scheduling problem. In this class of scheduling problems, there are multiple customer orders, and each of them consists of several jobs. The order finishes and is ready to be shipped when the last job of the order finishes. In this paper, we consider the customer order scheduling problem in a permutation flow shop environment with m machines. There are n orders and each order has o jobs. The objective is to minimize the total completion time of the orders. We present multiple problem properties and a MINLP formulation of the problem. Furthermore, four heuristics which follow the Iterated Greedy Algorithm are developed. In a computational experiment, we evaluated the four heuristics on their practicability. They showed good results in short calculation time when compared with the MINLP solution from a solver. Afterwards, we compared the four heuristics with each other for different problem sizes.

Suggested Citation

  • Hoffmann, Julius & Neufeld, Janis S. & Buscher, Udo, 2025. "Customer order scheduling in a permutation flow shop environment," Operations Research Perspectives, Elsevier, vol. 15(C).
    • Handle: RePEc:eee:oprepe:v:15:y:2025:i:c:s2214716025000387
    DOI: 10.1016/j.orp.2025.100362
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716025000387
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2025.100362?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. Lee, Ik Sun, 2013. "Minimizing total tardiness for the order scheduling problem," International Journal of Production Economics, Elsevier, vol. 144(1), pages 128-134.
    2. 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.
    3. Chang Sup Sung & Sang Hum Yoon, 1998. "Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines," International Journal of Production Economics, Elsevier, vol. 54(3), pages 247-255, May.
    4. Shengluo Yang & Zhigang Xu, 2021. "The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery," International Journal of Production Research, Taylor & Francis Journals, vol. 59(13), pages 4053-4071, July.
    5. Fuli Xiong & Siyuan Chen & Zongfang Ma & Linlin Li, 2023. "Approximate model and algorithms for precast supply chain scheduling problem with time-dependent transportation times," International Journal of Production Research, Taylor & Francis Journals, vol. 61(7), pages 2057-2085, April.
    6. 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.
    7. Leung, Joseph Y-T. & Li, Haibing & Pinedo, Michael & Sriskandarajah, Chelliah, 2005. "Open shops with jobs overlap--revisited," European Journal of Operational Research, Elsevier, vol. 163(2), pages 569-571, June.
    8. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    9. J.S. Neufeld & J.N.D. Gupta & U. Buscher, 2015. "Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1791-1806, March.
    10. Zhongshun Shi & Zewen Huang & Leyuan Shi, 2018. "Customer order scheduling on batch processing machines with incompatible job families," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 795-808, January.
    11. Chin-Chia Wu & Jatinder N. D. Gupta & Win-Chin Lin & Shuenn-Ren Cheng & Yen-Lin Chiu & Juin-Han Chen & Long-Yuan Lee, 2022. "Robust Scheduling of Two-Agent Customer Orders with Scenario-Dependent Component Processing Times and Release Dates," Mathematics, MDPI, vol. 10(9), pages 1-17, May.
    12. 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.
    13. 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.
    14. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    15. Wagneur, E. & Sriskandarajah, C., 1993. "Openshops with jobs overlap," European Journal of Operational Research, Elsevier, vol. 71(3), pages 366-378, December.
    16. 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.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Leung, Joseph Y.-T. & Lee, C.Y. & Ng, C.W. & Young, G.H., 2008. "Preemptive multiprocessor order scheduling to minimize total weighted flowtime," European Journal of Operational Research, Elsevier, vol. 190(1), pages 40-51, October.
    8. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    9. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    10. Tseng, Lin-Yu & Lin, Ya-Tai, 2009. "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 84-92, October.
    11. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    12. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    13. Husam Dauod & Nieqing Cao & Debiao Li & Jaehee Kim & Sang Won Yoon & Daehan Won, 2023. "An Order Scheduling Heuristic to Minimize the Total Collation Delays and the Makespan in High-Throughput Make-to-Order Manufacturing Systems," SN Operations Research Forum, Springer, vol. 4(2), pages 1-23, June.
    14. 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.
    15. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    16. Leung, Joseph Y-T. & Li, Haibing & Pinedo, Michael & Sriskandarajah, Chelliah, 2005. "Open shops with jobs overlap--revisited," European Journal of Operational Research, Elsevier, vol. 163(2), pages 569-571, June.
    17. Framinan, J. M. & Leisten, R., 2003. "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, Elsevier, vol. 31(4), pages 311-317, August.
    18. Fernandez-Viagas, Victor & Talens, Carla & Prata, Bruno de Athayde, 2025. "A speed-up procedure and new heuristics for the classical job shop scheduling problem: A computational evaluation," European Journal of Operational Research, Elsevier, vol. 322(3), pages 783-794.
    19. Li, Xiaoping & Wang, Qian & Wu, Cheng, 2009. "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, Elsevier, vol. 37(1), pages 155-164, February.
    20. Cheng, Jinliang & Steiner, George & Stephenson, Paul, 2001. "A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times," European Journal of Operational Research, Elsevier, vol. 130(3), pages 559-575, May.

    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:eee:oprepe:v:15:y:2025:i:c:s2214716025000387. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    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.