IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i19p2492-d650093.html
   My bibliography  Save this article

Non-Sequential Linear Construction Project Scheduling Model for Minimizing Idle Equipment Using Constraint Programming (CP)

Author

Listed:
  • Shu-Shun Liu

    (Department of Civil and Construction Engineering, National Yunlin University of Science & Technology, Yunlin 640, Taiwan)

  • Agung Budiwirawan

    (Graduate School of Engineering Science and Technology, National Yunlin University of Science & Technology, Yunlin 640, Taiwan
    Department of Civil Engineering, Universitas Negeri Semarang, Semarang 50229, Indonesia)

  • Muhammad Faizal Ardhiansyah Arifin

    (Graduate School of Engineering Science and Technology, National Yunlin University of Science & Technology, Yunlin 640, Taiwan
    Department of Civil Engineering, Universitas Negeri Semarang, Semarang 50229, Indonesia)

Abstract

Over the last several decades, the scheduling of linear construction projects (LCPs) has been explored extensively by experts. The linear scheduling method (LSM), which focuses on work rate and work continuity, has the advantage of tackling LCPs’ scheduling problems. The traditional LSM uses work continuity to monitor resource allocation continuity on the premise that activities with the same type of work use the same crew. However, some LCPs require a combination of different types of equipment to comprise the crew. Sometimes, parts of different crews require the same types of equipment, and sometimes, the same crew requires different equipment configurations. This causes the pattern of work continuity to be different from the pattern of resource allocation continuity. Therefore, we propose an optimization model of the LSM to minimize idle equipment on a non-sequential linear construction project—i.e., a road network maintenance project. This model is intended to minimize the number of idle equipment and their idle time to achieve more efficient scheduling for linear construction projects. This model offers novel details of resource allocation continuity assessment by taking into account equipment combination and configuration (ECC). Therefore, the scheduling concept used by the proposed model is named the linear scheduling model with ECC (LSM–ECC). The model was developed using constraint programming (CP), as CP has good performance and robustness in the optimization field. The model was implemented to a representation of a road network maintenance project and has satisfactory results.

Suggested Citation

  • Shu-Shun Liu & Agung Budiwirawan & Muhammad Faizal Ardhiansyah Arifin, 2021. "Non-Sequential Linear Construction Project Scheduling Model for Minimizing Idle Equipment Using Constraint Programming (CP)," Mathematics, MDPI, vol. 9(19), pages 1-26, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:19:p:2492-:d:650093
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/19/2492/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/19/2492/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fündeling, C.-U. & Trautmann, N., 2010. "A priority-rule method for project scheduling with work-content constraints," European Journal of Operational Research, Elsevier, vol. 203(3), pages 568-574, June.
    2. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    3. Aarabi, Fatemeh & Batta, Rajan, 2020. "Scheduling spatially distributed jobs with degradation: Application to pothole repair," Socio-Economic Planning Sciences, Elsevier, vol. 72(C).
    4. Naber, Anulark & Kolisch, Rainer, 2014. "MIP models for resource-constrained project scheduling with flexible resource profiles," European Journal of Operational Research, Elsevier, vol. 239(2), pages 335-348.
    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. Roland Braune & Karl F. Doerner, 2017. "Real-world flexible resource profile scheduling with multiple criteria: learning scalarization functions for MIP and heuristic approaches," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 952-972, August.
    2. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    3. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    4. Naber, Anulark & Kolisch, Rainer, 2014. "MIP models for resource-constrained project scheduling with flexible resource profiles," European Journal of Operational Research, Elsevier, vol. 239(2), pages 335-348.
    5. Talla Nobibon, Fabrice & Leus, Roel & Nip, Kameng & Wang, Zhenbo, 2015. "Resource loading with time windows," European Journal of Operational Research, Elsevier, vol. 244(2), pages 404-416.
    6. Jeunet, Jully & Bou Orm, Mayassa, 2020. "Optimizing temporary work and overtime in the Time Cost Quality Trade-off Problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 743-761.
    7. Mick Van Den Eeckhout & Broos Maenhout & Mario Vanhoucke, 2020. "Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs," Annals of Operations Research, Springer, vol. 292(1), pages 133-160, September.
    8. Tritschler, Martin & Naber, Anulark & Kolisch, Rainer, 2017. "A hybrid metaheuristic for resource-constrained project scheduling with flexible resource profiles," European Journal of Operational Research, Elsevier, vol. 262(1), pages 262-273.
    9. Guopeng Song & Tamás Kis & Roel Leus, 2021. "Polyhedral Results and Branch-and-Cut for the Resource Loading Problem," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 105-119, January.
    10. Ben Issa, Samer & Patterson, Raymond A. & Tu, Yiliu, 2021. "Solving resource-constrained multi-project environment under different activity assumptions," International Journal of Production Economics, Elsevier, vol. 232(C).
    11. Brachmann, Robert & Kolisch, Rainer, 2021. "The impact of flexibility on engineer-to-order production planning," International Journal of Production Economics, Elsevier, vol. 239(C).
    12. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
    13. Kellenbrink, Carolin & Helber, Stefan, 2015. "Scheduling resource-constrained projects with a flexible project structure," European Journal of Operational Research, Elsevier, vol. 246(2), pages 379-391.
    14. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    15. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    16. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    17. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    18. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    19. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    20. Brech, Claus-Henning & Ernst, Andreas & Kolisch, Rainer, 2019. "Scheduling medical residents’ training at university hospitals," European Journal of Operational Research, Elsevier, vol. 274(1), pages 253-266.

    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:jmathe:v:9:y:2021:i:19:p:2492-:d:650093. 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.