IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v108y2022ics0305048321001900.html
   My bibliography  Save this article

A column generation-based exact solution method for seru scheduling problems

Author

Listed:
  • Zhang, Zhe
  • Gong, Xue
  • Song, Xiaoling
  • Yin, Yong
  • Lev, Benjamin
  • Chen, Jie

Abstract

This paper attempts to address production scheduling problems in seru production systems (SPS), which is a new-type manufacturing system emanating from Japanese electronic assembly industry. As a typical parallel production system, SPS has high efficiency, good flexibility, and rapid responsiveness, which are achieved by reconfiguring serus, increasing, or decreasing workers to adjust the output in practical volatile markets. The seru scheduling problem in this paper is formulated as an integer programming (IP) model to minimize the total weighted completion time (TWCT). Then, by employing the Dantzig-Wolfe decomposition, the proposed IP model is reformulated into a set partitioning problem with a master problem and several subproblems. A branch-and-bound (B&B) algorithm is designed, and each node in a B&B tree is a linear relaxation problem (LRP) of the set partitioning problem. The LRP is solved by a column generation approach, in which each column is generated to represent a schedule of the seru in SPS based on solving the subproblems. Computational experiments are conducted, and the results indicate that the proposed column generation-based exact solution method is promising in solving the seru scheduling problem effectively.

Suggested Citation

  • Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Chen, Jie, 2022. "A column generation-based exact solution method for seru scheduling problems," Omega, Elsevier, vol. 108(C).
    • Handle: RePEc:eee:jomega:v:108:y:2022:i:c:s0305048321001900
    DOI: 10.1016/j.omega.2021.102581
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048321001900
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2021.102581?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Aleda Roth & Jaya Singhal & Kalyan Singhal & Christopher S. Tang, 2016. "Knowledge Creation and Dissemination in Operations and Supply Chain Management," Production and Operations Management, Production and Operations Management Society, vol. 25(9), pages 1473-1488, September.
    2. Lan Luo & Zhe Zhang & Yong Yin, 2017. "Modelling and numerical analysis of seru loading problem under uncertainty," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 11(2), pages 185-204.
    3. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    4. Wei Sun & Yang Yu & Qi Lou & Junwei Wang & Yuechao Guan, 2020. "Reducing the total tardiness by Seru production: model, exact and cooperative coevolution solutions," International Journal of Production Research, Taylor & Francis Journals, vol. 58(21), pages 6441-6452, November.
    5. Ho, Nhu Binh & Tay, Joc Cing & Lai, Edmund M.-K., 2007. "An effective architecture for learning and evolving flexible job-shop schedules," European Journal of Operational Research, Elsevier, vol. 179(2), pages 316-333, June.
    6. Rossit, Daniel Alejandro & Tohmé, Fernando & Frutos, Mariano, 2018. "The Non-Permutation Flow-Shop scheduling problem: A literature review," Omega, Elsevier, vol. 77(C), pages 143-153.
    7. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    8. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    9. Alidaee, Bahram & Li, Haitao & Wang, Haibo & Womer, Keith, 2021. "Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension," Omega, Elsevier, vol. 103(C).
    10. Offodile, O Felix, 1993. "Machine grouping in cellular manufacturing," Omega, Elsevier, vol. 21(1), pages 35-52, January.
    11. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    12. Stefano Gualandi & Federico Malucelli, 2012. "Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 81-100, February.
    13. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    14. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    15. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    16. Oron, Daniel, 2021. "Two-agent scheduling problems under rejection budget constraints," Omega, Elsevier, vol. 102(C).
    17. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    18. S. Viswanathan, 2007. "An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem," Operations Research, INFORMS, vol. 55(5), pages 992-996, October.
    19. Dell’Amico, Mauro & Montemanni, Roberto & Novellani, Stefano, 2021. "Algorithms based on branch and bound for the flying sidekick traveling salesman problem," Omega, Elsevier, vol. 104(C).
    20. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    21. Kathryn E. Stecke & Yong Yin & Ikou Kaku & Yasuhiko Murase, 2012. "Seru: The Organizational Extension of JIT for a Super-Talent Factory," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 3(1), pages 106-119, January.
    22. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    23. Zhang, XiaoLi & Liu, ChenGuang & Li, WenJuan & Evans, Steve & Yin, Yong, 2017. "Effects of key enabling technologies for seru production on sustainable performance," Omega, Elsevier, vol. 66(PB), pages 290-307.
    24. Zhou, Xiaoyang & Wei, Xiaoya & Lin, Jun & Tian, Xin & Lev, Benjamin & Wang, Shouyang, 2021. "Supply chain management under carbon taxes: A review and bibliometric analysis," Omega, Elsevier, vol. 98(C).
    25. L. R. Ford, Jr. & D. R. Fulkerson, 1958. "A Suggested Computation for Maximal Multi-Commodity Network Flows," Management Science, INFORMS, vol. 5(1), pages 97-101, October.
    26. Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
    27. J.M. van den Akker & C.A.J. Hurkens & M.W.P. Savelsbergh, 2000. "Time-Indexed Formulations for Machine Scheduling Problems: Column Generation," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 111-124, May.
    28. Breugem, T. & van Rossum, B.T.C. & Dollevoet, T. & Huisman, D., 2022. "A column generation approach for the integrated crew re-planning problem," Omega, Elsevier, vol. 107(C).
    29. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2017. "A branch-and-price algorithm for production routing problems with carbon cap-and-trade," Omega, Elsevier, vol. 68(C), pages 49-61.
    30. Yong Yin & Kathryn E. Stecke & Dongni Li, 2018. "The evolution of production systems from Industry 2.0 through Industry 4.0," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 848-861, January.
    31. Fanjul-Peyro, Luis & Perea, Federico & Ruiz, Rubén, 2017. "Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources," European Journal of Operational Research, Elsevier, vol. 260(2), pages 482-493.
    32. Wang, Chao & Lim, Ming K & Zhao, Longfeng & Tseng, Ming-Lang & Chien, Chen-Fu & Lev, Benjamin, 2020. "The evolution of Omega-The International Journal of Management Science over the past 40 years: A bibliometric overview," Omega, Elsevier, vol. 93(C).
    33. Earl E. Bomberger, 1966. "A Dynamic Programming Approach to a Lot Size Scheduling Problem," Management Science, INFORMS, vol. 12(11), pages 778-784, July.
    34. Yu, Yang & Tang, Jiafu & Gong, Jun & Yin, Yong & Kaku, Ikou, 2014. "Mathematical analysis and solutions for multi-objective line-cell conversion problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 774-786.
    35. Yu, Yang & Tang, Jiafu & Sun, Wei & Yin, Yong & Kaku, Ikou, 2013. "Reducing worker(s) by converting assembly line into a pure cell system," International Journal of Production Economics, Elsevier, vol. 145(2), pages 799-806.
    36. Antonio Frangioni, 2005. "About Lagrangian Methods in Integer Optimization," Annals of Operations Research, Springer, vol. 139(1), pages 163-193, October.
    37. Zhi Pei & Mingzhong Wan & Ziteng Wang, 2020. "A new approximation algorithm for unrelated parallel machine scheduling with release dates," Annals of Operations Research, Springer, vol. 285(1), pages 397-425, February.
    38. Wu, Xueqi & Che, Ada, 2019. "A memetic differential evolution algorithm for energy-efficient parallel machine scheduling," Omega, Elsevier, vol. 82(C), pages 155-165.
    39. Tempelmeier, Horst, 2011. "A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint," Omega, Elsevier, vol. 39(6), pages 627-633, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    2. Shao, Kaining & Fan, Wenjuan & Lan, Shaowen & Kong, Min & Yang, Shanlin, 2023. "A column generation-based heuristic for brachytherapy patient scheduling with multiple treatment sessions considering radioactive source decay and time constraints," Omega, Elsevier, vol. 118(C).
    3. Li, Dongni & Jiang, Yuzhou & Zhang, Jinhui & Cui, Zihua & Yin, Yong, 2023. "An on-line seru scheduling algorithm with proactive waiting considering resource conflicts," European Journal of Operational Research, Elsevier, vol. 309(2), pages 506-515.
    4. Justkowiak, Jan-Erik & Pesch, Erwin, 2023. "A column generation driven heuristic for order-scheduling and rack-sequencing in robotic mobile fulfillment systems," Omega, Elsevier, vol. 120(C).

    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. Zhe Zhang & Xiaoling Song & Huijun Huang & Yong Yin & Benjamin Lev, 2022. "Scheduling problem in seru production system considering DeJong’s learning effect and job splitting," Annals of Operations Research, Springer, vol. 312(2), pages 1119-1141, May.
    2. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    3. Li, Dongni & Jiang, Yuzhou & Zhang, Jinhui & Cui, Zihua & Yin, Yong, 2023. "An on-line seru scheduling algorithm with proactive waiting considering resource conflicts," European Journal of Operational Research, Elsevier, vol. 309(2), pages 506-515.
    4. Ye Wang & Jiafu Tang, 2022. "Optimized skill configuration for the seru production system under an uncertain demand," Annals of Operations Research, Springer, vol. 316(1), pages 445-465, September.
    5. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    6. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    7. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    8. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    9. Marjan van den Akker & Han Hoogeveen & Steef van de Velde, 2002. "Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 37-51, February.
    10. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    11. Kuo-Ching Ying & Yi-Ju Tsai, 2017. "Minimising total cost for training and assigning multiskilled workers in production systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2978-2989, May.
    12. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
    13. Timo Gschwind & Stefan Irnich, 2014. "Dual Inequalities for Stabilized Column Generation Revisited," Working Papers 1407, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 23 Jul 2014.
    14. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    15. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    16. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    17. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
    18. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    19. Andrew Allman & Qi Zhang, 2021. "Branch-and-price for a class of nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 81(4), pages 861-880, December.
    20. Guy Desaulniers & François Lessard & Ahmed Hadjar, 2008. "Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 387-404, August.

    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:jomega:v:108:y:2022:i:c:s0305048321001900. 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.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.