Skip to main content
SpringerLink
Log in

Production and transport scheduling in flexible job shop manufacturing systems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper addresses an extension of the flexible job shop scheduling problem by considering that jobs need to be moved around the shop-floor by a set of vehicles. Thus, this problem involves assigning each production operation to one of the alternative machines, finding the sequence of operations for each machine, assigning each transport task to one of the vehicles, and finding the sequence of transport tasks for each vehicle, simultaneously. Transportation is usually neglected in the literature and when considered, an unlimited number of vehicles is, typically, assumed. Here, we propose the first mixed integer linear programming model for this problem and show its efficiency at solving small-sized instances to optimality. In addition, and due to the NP-hard nature of the problem, we propose a local search based heuristic that the computational experiments show to be effective, efficient, and robust.

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

Similar content being viewed by others

Notes

  1. Bilge and Ulusoy [5] compute, for each problem instance, the traveling time t as the average loaded traveling time, that is, the average time among all transport tasks and the processing time p as the average processing time over all production operations.

  2. All instances data can be found in https://fastmanufacturingproject.wordpress.com/ problem-instances.

References

  1. Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manag. Sci. 34(3), 391–401 (1988)

    Article  MathSciNet  Google Scholar 

  2. Afsar, H.M., Artigues, C., Bourreau, E., Kedad-Sidhoum, S.: Machine reassignment problem: the roadef/euro challenge 2012. Ann. Oper. Res. 242(1), 1–17 (2016)

    Article  MathSciNet  Google Scholar 

  3. Amjad, M.K., Butt, S.I., Kousar, R., Ahmad, R., Agha, M.H., Faping, Z., Anjum, N., Asgher, U.: Recent research trends in genetic algorithm based flexible job shop scheduling problems. Math. Probl. Eng. 2018, 9270802 (2018)

    Article  Google Scholar 

  4. Bagheri, A., Mostafa, Z., Iraj, M., Mehdi, Y.: An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener. Comput. Syst. 26(4), 533–541 (2010)

    Article  Google Scholar 

  5. Bilge, Ü., Ulusoy, G.: A time window approach to simultaneous scheduling of machines and material handling system in an fms. Oper. Res. 43(6), 1058–1070 (1995)

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT, Conference, Montreal, Canada (2008)

  8. Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70–78 (2017)

    Article  MathSciNet  Google Scholar 

  9. Chambers, J.B., Barnes, J.W.: Tabu search for the flexible-routing job shop problem. In: Graduate Program in Operations Research and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-10 (1996)

  10. Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551–591 (2016)

    Article  MathSciNet  Google Scholar 

  11. De Smet, G.: Optaplanner user guide. Red Hat and the community

  12. Deroussi, L.: A hybrid pso applied to the flexible job shop with transport. In: International Conference on Swarm Intelligence Based Optimization, pp 115–122. Springer (2014)

  13. Deroussi, L., Norre, S.: Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: International Conference on Metaheuristics and Nature Inspired Computing, pp 1–2. Djerba Island Tunisia (2010)

  14. Fattahi, P., Saidi-Mehrabad, M., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18(3), 331–342 (2007)

    Article  Google Scholar 

  15. Fisher, H., Thompson. G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling. Prentice-Hall, Englewood Cliffs (1963)

  16. Fontes, D.B.M.M., Homayouni, S.M.: Joint production and transportation scheduling in flexible manufacturing systems. J. Glob. Optim. 74(4), 879–908 (2019)

    Article  MathSciNet  Google Scholar 

  17. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of np-completeness, W. H. Freeman & Co. (1979)

  18. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MathSciNet  Google Scholar 

  19. LLC Gurobi Optimization. Gurobi optimizer reference manual, (2018)

  20. Kumar, M.V.S., Janardhana, R., Rao, C.S.P.: Simultaneous scheduling of machines and vehicles in an fms environment with alternative routing. Int. J. Adv. Manuf. Technol. 53(1–4), 339–351 (2011)

    Article  Google Scholar 

  21. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22–35 (1978)

  22. Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93–110 (2016)

    Article  Google Scholar 

  23. Nouri, H.E., Driss, O.B., Ghédira, K.: A classification schema for the job shop scheduling problem with transportation resources: state-of-the-art review. In: Artificial Intelligence Perspectives in Intelligent Systems, pp 1–11. Springer (2016)

  24. Nouri, H.E., Driss, O.B., Ghédira, K.: Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Comput. Ind. Eng. 102, 488–501 (2016)

    Article  Google Scholar 

  25. Orloff, C.S.: Route constrained fleet scheduling. Transp. Sci. 10(2), 149–168 (1976)

    Article  Google Scholar 

  26. Reddy, B.S.P., Rao, C.S.P.: A hybrid multi-objective ga for simultaneous scheduling of machines and agvs in fms. Int. J. Adv. Manuf. Technol. 31(5–6), 602–613 (2006)

    Article  Google Scholar 

  27. Shen, L., Dauzère-Pérès, S., Neufeld, J.S.: Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 265(2), 503–516 (2018)

    Article  MathSciNet  Google Scholar 

  28. Wauters, T., Toffolo, T., Christiaens, J., Van Malderen, S.: The winning approach for the verolog solver challenge: the swap-body vehicle routing problem. Proc. ORBEL 29, 2015 (2014)

    Google Scholar 

  29. Zhang, Q., Manier, H., Manier, M.-A.: 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 (2012)

    Article  MathSciNet  Google Scholar 

  30. Zhang, Q., Manier, H., Manier, M.-A.: Metaheuristics for job shop scheduling with transportation, In: Jarboui, B., Siarry, P., Teghem, J. (eds.) Metaheuristics for Production Scheduling, Wiley (2013)

  31. Zhang, Q., Manier, H., Manier, M.-A.: A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints. Int. J. Prod. Res. 52(4), 985–1002 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

We acknowledge the financial support of FEDER/COMPETE2020/NORTE2020/POCI/ PIDDAC/MCTES/FCT funds through grants POCI-01-0145-FEDER-031821 and POCI-01-0145-FEDER-031447 and the Education and Research Deputy Dean of the Islamic Azad University, Lenjan Branch

Author information

Authors and Affiliations

  1. LIAAD - INESC TEC, Porto, Portugal

    Seyed Mahdi Homayouni & Dalila B. M. M. Fontes

  2. Department of Industrial Engineering, Islamic Azad University, Lenjan Branch, Esfahan, Iran

    Seyed Mahdi Homayouni

  3. Faculdade de Economia da Universidade do Porto, Porto, Portugal

    Dalila B. M. M. Fontes

Authors
  1. Seyed Mahdi Homayouni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dalila B. M. M. Fontes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Mahdi Homayouni.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A: Data for problem instances in set 1

Table 12 Set 1: job sets, alternative machines, and processing times [13]
Full size table
Table 13 Set 1: transport times [13]
Full size table

Appendix B: Data for problem instances in set 2

Table 14 Set 1: Set 2: job sets, alternative machines, and processing times [20]
Full size table
Table 15 Set 2: transport times [5]
Full size table

Appendix C: LB values for problem instances in sets 1–5

Table 16 Set 1: LB values
Full size table
Table 17 Set 2: LB values
Full size table
Table 18 Set 3: LB values
Full size table
Table 19 Set 4: LB values
Full size table
Table 20 Set 5: LB values
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Homayouni, S.M., Fontes, D.B.M.M. Production and transport scheduling in flexible job shop manufacturing systems. J Glob Optim 79, 463–502 (2021). https://doi.org/10.1007/s10898-021-00992-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-021-00992-6

Keywords

Search

Navigation