Skip to main content
SpringerLink
Log in

A heuristic scheduling method for the pipe-spool fabrication process

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

The pipe-spool fabrication process is a critical operational section in the piping projects that usually used to accelerate and discipline the installation process, especially, when we have a particular deadline for the project. For this reason, the fast and optimal scheduling of the fabrication activities with considering the real conditions and using manual or traditional methods is a significant problem for the decision-makers. In this paper, we use a novel linear programming model to schedule the spool fabrication activities based on the flexible job shop scheduling problem (FJSP). Because FJSP is a challengeable NP-hard problem, we solve the proposed mathematical model with a heuristic scheduling method based on the priority dispatching rules. Meanwhile, a mathematical lower bound is extended for the scheduling problem to show the correctness of the proposed method. Finally, some numerical results validate the quality of the proposed method, based on the comparison analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Ahmadi E, Zandieh M, Farrokh M, Emami SM (2016) A multi-objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput Oper Res 73:56–66

    Article  MathSciNet  Google Scholar 

  • Bagheri A, Zandieh M (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach. J Manuf Syst 30(1):8–15

    Article  Google Scholar 

  • Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541

    Article  Google Scholar 

  • Bierwirth C, Kuhpfahl J (2017) Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur J Oper Res 261(3):835–848. https://doi.org/10.1016/j.ejor.2017.03.030

    Article  MathSciNet  MATH  Google Scholar 

  • Birgin EG, Ferreira J, Ronconi DP (2015) List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility. Eur J Oper Res 247(2):421–440

    Article  MathSciNet  Google Scholar 

  • Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157–183

    Article  Google Scholar 

  • Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369–375

    Article  MathSciNet  Google Scholar 

  • Bürgy R, Gröflin H (2013) Optimal job insertion in the no-wait job shop. J Comb Optim 26(2):345–371. https://doi.org/10.1007/s10878-012-9466-y

    Article  MathSciNet  MATH  Google Scholar 

  • Bürgy R, Gröflin H (2016) The blocking job shop with rail-bound transportation. J Comb Optim 31(1):152–181. https://doi.org/10.1007/s10878-014-9723-3

    Article  MathSciNet  MATH  Google Scholar 

  • Bürgy R, Gröflin H (2017) The no-wait job shop with regular objective: a method based on optimal job insertion. J Comb Optim 33(3):977–1010. https://doi.org/10.1007/s10878-016-0020-1

    Article  MathSciNet  MATH  Google Scholar 

  • Chan F, Chan H, Lau H, Ip R (2003) Analysis of dynamic dispatching rules for a flexible manufacturing system. J Mater Process Technol 138(1):325–331

    Article  Google Scholar 

  • Chang H-C, Liu T-K (2015) Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J Intell Manuf 28(8):1973–1986

    Article  Google Scholar 

  • Defersha FM, Chen M (2010) A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence-dependent setups. Int J Adv Manuf Technol 49(1):263–279. https://doi.org/10.1007/s00170-009-2388-x

    Article  Google Scholar 

  • El Khoukhi F, Boukachour J, El AH Alaoui (2017) The “Dual-Ants Colony”: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput Ind Eng 106(Supplement C):236–255. https://doi.org/10.1016/j.cie.2016.10.019

    Article  Google Scholar 

  • Gao K-Z, Suganthan PN, Pan Q-K, Chua TJ, Cai TX, Chong C-S (2014) Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf Sci 289:76–90

    Article  MathSciNet  Google Scholar 

  • Gao KZ, Suganthan PN, Pan QK, Chua TJ, Chong CS, Cai TX (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52–67

    Article  Google Scholar 

  • Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129

    Article  MathSciNet  Google Scholar 

  • González MA, Vela CR, Varela R (2015) Scatter search with path-relinking for the flexible job shop scheduling problem. Eur J Oper Res 245(1):35–45

    Article  MathSciNet  Google Scholar 

  • Gröflin H, Pham DN, Bürgy R (2011) The flexible blocking job shop with transfer and set-up times. J Comb Optim 22(2):121–144. https://doi.org/10.1007/s10878-009-9278-x

    Article  MathSciNet  MATH  Google Scholar 

  • Gu M, Lu X, Gu J (2017) An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan. J Comb Optim 33(2):473–495. https://doi.org/10.1007/s10878-015-9974-7

    Article  MathSciNet  MATH  Google Scholar 

  • Haupt R (1989) A survey of priority rule-based scheduling. OR Spectr 11(1):3–16

    Article  MathSciNet  Google Scholar 

  • Hu D, Mohamed Y (2012) Pipe spool fabrication sequencing by automated planning. Paper presented at the construction research congress 2012: construction challenges in a flat world

  • Hu D, Mohamed Y (2014) A dynamic programming solution to automate fabrication sequencing of industrial construction components. Autom Constr 40(Supplement C):9–20. https://doi.org/10.1016/j.autcon.2013.12.013

    Article  Google Scholar 

  • Huang R-H, Yang C-L, Cheng W-C (2013) Flexible job shop scheduling with due window—a two-pheromone ant colony approach. Int J Prod Econ 141(2):685–697

    Article  Google Scholar 

  • Jayamohan M, Rajendran C (2004) Development and analysis of cost-based dispatching rules for job shop scheduling. Eur J Oper Res 157(2):307–321

    Article  Google Scholar 

  • Jeong K-C, Kim Y-D (1998) A real-time scheduling mechanism for a flexible manufacturing system: using simulation and dispatching rules. Int J Prod Res 36(9):2609–2626

    Article  Google Scholar 

  • Kamble S, Mane S, Umbarkar A (2015) Hybrid multi-objective particle swarm optimization for flexible job shop scheduling problem. Int J Intell Syst Appl 7(4):54

    Google Scholar 

  • Li J-Q, Pan Q-K, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38(3):1111–1132

    Article  MathSciNet  Google Scholar 

  • Li X, Peng Z, Du B, Guo J, Xu W, Zhuang K (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng 113(Supplement C):10–26. https://doi.org/10.1016/j.cie.2017.09.005

    Article  Google Scholar 

  • Liang X, Huang M, Ning T (2016) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-016-0425-9

    Article  Google Scholar 

  • Lu C, Li X, Gao L, Liao W, Yi J (2017) An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times. Comput Ind Eng 104(Supplement C):156–174. https://doi.org/10.1016/j.cie.2016.12.020

    Article  Google Scholar 

  • Mokhtari H, Hasani A (2017) An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Comput Chem Eng 104:339–352

    Article  Google Scholar 

  • Nagata Y, Ono I (2018) A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem. Comput Oper Res 90:60–71

    Article  MathSciNet  Google Scholar 

  • Natarajan K, Mohanasundaram K, Babu BS, Suresh S, Raj KAAD., Rajendran C (2007) Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flow time and tardiness. Int J Adv Manuf Technol 31(7):751–761

    Google Scholar 

  • Ning T, Huang M, Liang X, Jin H (2016) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Humaniz Comput 7(5):721–729. https://doi.org/10.1007/s12652-016-0370-7

    Article  Google Scholar 

  • Ning T, Jin H, Song X, Li B (2017) An improved quantum genetic algorithm based on MAGTD for dynamic FJSP. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-017-0486-4

    Article  Google Scholar 

  • Nouiri M, Bekrar A, Jemai A, Trentesaux D, Ammari AC, Niar S (2017). Two-stage particle swarm optimization to solve the flexible job shop predictive scheduling problem considering possible machine breakdowns. Comput Ind Eng 112(Supplement C):595–606. https://doi.org/10.1016/j.cie.2017.03.006

    Article  Google Scholar 

  • Özgüven C, Yavuz Y, Özbakır L (2012) Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Appl Math Model 36(2):846–858

    Article  MathSciNet  Google Scholar 

  • Palacios JJ, González MA, Vela CR, González-Rodríguez I, Puente J (2015) Genetic tabu search for the fuzzy flexible job shop problem. Comput Oper Res 54:74–89

    Article  MathSciNet  Google Scholar 

  • Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35(10):3202–3212

    Article  Google Scholar 

  • Pinedo M (2012) Scheduling (4th edn), Springer, Boston, MA

    Book  Google Scholar 

  • Rossi A (2014) Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships. Int J Prod Econ 153:253–267

    Article  Google Scholar 

  • Shahsavari-Pour N, Ghasemishabankareh B (2013) A novel hybrid meta-heuristic algorithm for solving multi-objective flexible job shop scheduling. J Manuf Syst 32(4):771–780

    Article  Google Scholar 

  • Shen X-N, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224

    Article  MathSciNet  Google Scholar 

  • Song J, Haas CT, Caldas C, Ergen E, Akinci B (2006) Automating the task of tracking the delivery and receipt of fabricated pipe spools in industrial projects. Autom Constr 15(2):166–177

    Article  Google Scholar 

  • Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54(3):453–473

    Article  Google Scholar 

  • Teekeng W, Thammano A (2012) Modified genetic algorithm for flexible job-shop scheduling problems. Procedia Comput Sci 12:122–128

    Article  Google Scholar 

  • Tommelein ID (1998) Pull-driven scheduling for pipe-spool installation: simulation of lean construction technique. J Constr Eng Manag 124(4):279–288

    Article  Google Scholar 

  • Tommelein ID (2006) Process benefits from use of standard products-simulation experiments using the pipe spool model. Paper presented at the 14th Conference of the International Group for Lean Construction (IGLC14)

  • Toporkov V, Toporkova A, Tselishchev A, Yemelyanov D, Potekhin P (2015) Heuristic strategies for preference-based scheduling in virtual organizations of utility grids. J Ambient Intell Humaniz Comput 6(6):733–740. https://doi.org/10.1007/s12652-015-0274-y

    Article  Google Scholar 

  • Wagner HM (1959) An integer linear programming model for machine scheduling. Nav Res Logist Q 6(2):131–140. https://doi.org/10.1002/nav.3800060205

    Article  MathSciNet  Google Scholar 

  • Wang X, Xie X, Cheng T (2013) Order acceptance and scheduling in a two-machine flowshop. Int J Prod Econ 141(1):366–376

    Article  Google Scholar 

  • Wu X, Wu S (2017) An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem. J Intell Manuf 28(6):1441–1457. https://doi.org/10.1007/s10845-015-1060-6

    Article  Google Scholar 

  • Xiao Y-Y, Zhang R-Q, Zhao Q-H, Kaku I (2012) Permutation flow shop scheduling with order acceptance and weighted tardiness. Appl Math Comput 218(15):7911–7926

    MathSciNet  MATH  Google Scholar 

  • Xing L-N, Chen Y-W, Wang P, Zhao Q-S, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888–896

    Article  Google Scholar 

  • Xu Y, Wang L, Wang S-y, Liu M (2015) An effective teaching–learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time. Neurocomputing 148:260–268

    Article  Google Scholar 

  • Xu H, Bao Z, Zhang T (2017) Solving dual flexible job-shop scheduling problem using a Bat algorithm. Adv Prod Eng Manag 12(1):5

    MathSciNet  Google Scholar 

  • Zandieh M, Khatami A, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449–464

    Article  Google Scholar 

  • Zhang Q, Manier H, Manier M-A (2012) A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Comput Oper Res 39(7):1713–1723

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran

    Soroush Safarzadeh

  2. Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran

    Shahram Shadrokh

  3. Neyrperse Corporation, MAPNA Industrial Group, Tehran, Iran

    Abolfazl Salehian

Authors
  1. Soroush Safarzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahram Shadrokh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abolfazl Salehian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soroush Safarzadeh.

Appendix

Appendix

A complete list of the priority dispatching rules that are extracted from references is given in Table 5.

Table 5 Complete list of the priority dispatching rules
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Safarzadeh, S., Shadrokh, S. & Salehian, A. A heuristic scheduling method for the pipe-spool fabrication process. J Ambient Intell Human Comput 9, 1901–1918 (2018). https://doi.org/10.1007/s12652-018-0737-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-018-0737-z

Keywords

Search

Navigation