IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i18p13785-d1240780.html
   My bibliography  Save this article

A Discrete Cooperative Control Method for Production Scheduling Problem of Assembly Manufacturing System

Author

Listed:
  • Xiao Wang

    (Department of Mechanical and Electronic Engineering, Shandong University of Science and Technology, Qingdao 266590, China)

  • Mei Liu

    (Advanced Manufacturing Technology Center, Shandong University of Science and Technology, Qingdao 266590, China)

  • Peisi Zhong

    (Department of Mechanical and Electronic Engineering, Shandong University of Science and Technology, Qingdao 266590, China)

  • Chao Zhang

    (Department of Mechanical and Electronic Engineering, Shandong University of Science and Technology, Qingdao 266590, China)

  • Dawei Zhang

    (Department of Mechanical and Electronic Engineering, Shandong University of Science and Technology, Qingdao 266590, China)

Abstract

With a sharp decrease in resource utilization of the complex production process, integrated scheduling methods are urgently needed in assembly manufacturing industries. To this end, this paper presents an integrated scheduling with jobs processing and assembly sequence (ISJPAS) problem where jobs and assemblies can be processed simultaneously. As the first contribution to this work, we develop a mixed integer nonlinear programming model (MINLP) that aims at minimizing maximum completion time and determining the earliness and tardiness of jobs and resulting inventory time. The structured property of the optimal scheduling solution is analyzed with regard to job sequencing and assembly sequencing. The NP-hard nature of the problem is proved, which provides upper and lower bounds on the optimal solution. Second, an efficient discrete assembly time and arrival time control (DAATC) method is presented based on continuous time variable control models. From a modified set of benchmark problems, the proposed method is tested by comparing four assembly association levels in real applications. The comparisons indicate the potentiality of our method to satisfy the due date. Lastly, relevance of practical applications are discussed, and several future research avenues are emphasized.

Suggested Citation

  • Xiao Wang & Mei Liu & Peisi Zhong & Chao Zhang & Dawei Zhang, 2023. "A Discrete Cooperative Control Method for Production Scheduling Problem of Assembly Manufacturing System," Sustainability, MDPI, vol. 15(18), pages 1-23, September.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:18:p:13785-:d:1240780
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/18/13785/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/18/13785/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jingjing Xu & Lei Wang, 2017. "A Feedback Control Method for Addressing the Production Scheduling Problem by Considering Energy Consumption and Makespan," Sustainability, MDPI, vol. 9(7), pages 1-14, July.
    2. Guanghui Zhang & Keyi Xing & Feng Cao, 2018. "Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan," International Journal of Production Research, Taylor & Francis Journals, vol. 56(9), pages 3226-3244, May.
    3. D. P. Williamson & L. A. Hall & J. A. Hoogeveen & C. A. J. Hurkens & J. K. Lenstra & S. V. Sevast'janov & D. B. Shmoys, 1997. "Short Shop Schedules," Operations Research, INFORMS, vol. 45(2), pages 288-294, April.
    4. Chin-Chia Wu & Ameni Azzouz & I-Hong Chung & Win-Chin Lin & Lamjed Ben Said, 2019. "A two-stage three-machine assembly scheduling problem with deterioration effect," International Journal of Production Research, Taylor & Francis Journals, vol. 57(21), pages 6634-6647, November.
    5. Sculli, D, 1987. "Priority dispatching rules in an assembly shop," Omega, Elsevier, vol. 15(1), pages 49-57.
    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. Hajo Terbrack & Thorsten Claus & Frank Herrmann, 2021. "Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme," Sustainability, MDPI, vol. 13(23), pages 1-32, December.
    2. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    3. Jun Hyeok Kang & Jinil Han, 2019. "Optimizing the Operation of Animal Shelters to Minimize Unnecessary Euthanasia: A Case Study in the Seoul Capital Area," Sustainability, MDPI, vol. 11(23), pages 1-13, November.
    4. Kubale, Marek & Nadolski, Adam, 2005. "Chromatic scheduling in a cyclic open shop," European Journal of Operational Research, Elsevier, vol. 164(3), pages 585-591, August.
    5. Han Hoogeveen & Petra Schuurman & Gerhard J. Woeginger, 2001. "Non-Approximability Results for Scheduling Problems with Minsum Criteria," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 157-168, May.
    6. D Bai & L Tang, 2010. "New heuristics for flow shop problem to minimize makespan," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(6), pages 1032-1040, June.
    7. Inna G. Drobouchevitch, 2021. "Three-machine open shop with a bottleneck machine revisited," Journal of Scheduling, Springer, vol. 24(2), pages 197-208, April.
    8. Antonina P. Khramova & Ilya Chernykh, 2021. "A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing," Journal of Scheduling, Springer, vol. 24(4), pages 405-412, August.
    9. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    10. Drobouchevitch, Inna G. & Strusevich, Vitaly A., 2001. "Two-stage open shop scheduling with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 128(1), pages 159-174, January.
    11. Wenzhu Liao & Tong Wang, 2019. "A Novel Collaborative Optimization Model for Job Shop Production–Delivery Considering Time Window and Carbon Emission," Sustainability, MDPI, vol. 11(10), pages 1-27, May.
    12. Jin Huang & Liangliang Jin & Chaoyong Zhang, 2017. "Mathematical Modeling and a Hybrid NSGA-II Algorithm for Process Planning Problem Considering Machining Cost and Carbon Emission," Sustainability, MDPI, vol. 9(10), pages 1-18, September.
    13. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    14. Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
    15. Nikhil Bansal & Mohammad Mahdian & Maxim Sviridenko, 2005. "Minimizing Makespan in No-Wait Job Shops," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 817-831, November.
    16. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    17. Drobouchevitch, I. G. & Strusevich, V. A., 2000. "Heuristics for the two-stage job shop scheduling problem with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 123(2), pages 229-240, June.
    18. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    19. Jansen, Klaus & Mastrolilli, Monaldo & Solis-Oba, Roberto, 2005. "Approximation schemes for job shop scheduling problems with controllable processing times," European Journal of Operational Research, Elsevier, vol. 167(2), pages 297-319, December.
    20. Guide, V. Daniel R. & Kraus, Mark E. & Srivastava, Rajesh, 1997. "Scheduling policies for remanufacturing," International Journal of Production Economics, Elsevier, vol. 48(2), pages 187-204, January.

    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:gam:jsusta:v:15:y:2023:i:18:p:13785-:d:1240780. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.