IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i18p5505-5522.html
   My bibliography  Save this article

Solving the integrated process planning and scheduling problem using an enhanced constraint programming-based approach

Author

Listed:
  • Ganquan Shi
  • Zhouwang Yang
  • Yang Xu
  • Yuchen Quan

Abstract

Due to various factors of flexibility introduced into manufacturing systems, researchers have gradually shifted their focus to the integrated process planning and scheduling (IPPS) problem to improve productivity. The previous literature rarely associates IPPS with constraint programming, even though constraint programming has achieved success in the scheduling field. Furthermore, existing approaches are usually customized to certain types of IPPS problems and cannot handle the general problem. In this paper, with a view to obtaining the optimal AND/OR graph automatically, a depth first search generating algorithm is designed to convert the type-1 IPPS problem into our approach's standard input format. Moreover, we propose an approach based on enhanced constraint programming to cope with the general problem, employing advanced schemes to enhance the constraint propagation and improve the search efficiency. Our approach is implemented on ORTOOLS, and its superiority is verified by testing on 15 benchmarks with 50 instances. Experimental results indicate that 41 instances are solved optimally, among which the optimality of the solutions for 20 instances is newly confirmed, and the solutions of six instances are improved. Our approach is the first method to reach the overall optimum in the most influential benchmark with 24 instances.

Suggested Citation

  • Ganquan Shi & Zhouwang Yang & Yang Xu & Yuchen Quan, 2022. "Solving the integrated process planning and scheduling problem using an enhanced constraint programming-based approach," International Journal of Production Research, Taylor & Francis Journals, vol. 60(18), pages 5505-5522, September.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:18:p:5505-5522
    DOI: 10.1080/00207543.2021.1963496
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1963496
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1963496?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.

    More about this item

    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:taf:tprsxx:v:60:y:2022:i:18:p:5505-5522. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.