Job shop scheduling problem based on learning effects, flexible maintenance activities and transportation times

Document Type : Research Paper


Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran


Nowadays, scholars do their best to study more practical aspects of classical problems. Job shop Scheduling Problem (JSSP) is an important and interesting problem in scheduling literature which has been studied from different aspects so far. Considering assumptions like learning effects, flexible maintenance activities and transportation times can make this problem more close to the real life, however these assumptions have rarely been studied in this problem. This paper aims to provide a mathematical model of JSSP which covers these assumptions. MILP model is suggested, Three different sizes of instances are generated randomly,  and this model has been solved for small-sized problems exactly by GAMS software and the effects of learning on reducing the value of objective function is shown. Due to the complexity of the problem, in order to obtain near optimal solutions, medium and large instances are solve by applying Ant Colony Optimization for continuous domains(ACOR) and Invasive weed Optimization (IWO) algorithm, finally results are compared.


Main Subjects

Ahmadizar, F., Shahmaleki, p. (2014).Group-shop scheduling with sequence-dependent set-up and transportation times, Applied Mathematical Modelling, 38(21) 5080-5091.
Amirian, H., Sahraeian, R. (2015). Augmented ε-constraint method in multi-objective flow shop problem with past sequence set-up times and a modified learning effect. International Journal of Production Research, 53 (19), 1-15.
Azzouz, A., Ennigrou, M., & Ben Said, L. (2018). Scheduling problems under learning effects: classification and cartography, International Journal of Production Research, 56(4), 1642–1661.
Behnamian, J., Zandieh,M.(2013). Earliness and Tardiness Minimizing on a Realistic Hybrid Flowshop Scheduling with Learning Effect by Advanced Metaheuristic, Arab J Sci Eng 38, 1229–1242 .
Benttaleb, M., Hnaien, F., & Yalaoui, F. (2018). Two-machine job shop problem under availability constraints on one machine: Makespan minimization; Computers & Industrial Engineering 117, 138–151.
Bilchev, G., Parmee, I. (1995). The Ant Colony Metaphor for Searching Continuous Design Spaces. In Fogarty, T.C., and ed.: Evolutionary Computing. AISB Workshop. Springer, Sheffield, UK: 25–39.
Biskup, D. (2008). A state-of-the-art review on scheduling with learning effect, European Journal of Operational Research, 188(2), 188 – 315.
Biskup, D. (1999). Single-machine scheduling with learning considerations, European Journal of Operational Research, 115 (1), 173–178.
Colorni, Am., Dorigo, M., Maniezzo, V (1992). Distributed Optimization by Ant Colonies. EUROPEAN CONFERENCE ON ARTIFICIAL LIFE, PARIS, FRANCE, ELSEVIER PUBLISHING, 134–142.
Dehnar saidy, H., Taghvi-Fard, M. (2008). Study of Scheduling Problems with Machine Availability Constraint. Journal of Industrial and Systems Engineering Vol. 1, No. 4, pp 360-383.
Fattahi, p, Daneshamooz, F. (2017). Hybrid algorithms for job shop scheduling problem with lot streaming and a parallel assembly stage. Journal of Industrial and Systems Engineering, 10(3), 92-112.
Lei, D., (2010). Fuzzy job shop scheduling problem with availability constraints. Computers & Industrial Engineering 58, 610–617.
Lei, D., (2013). Multi-objective artificial bee colony for interval job shop scheduling with flexible maintenance, Int J Adv Manuf Technol 66, 1835–1843.
Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58(2), 199–211.
Mehrabian, A.R., Lucas, C. (2006). A novel Numerical Optimization Algorithm Inspired from Weed Colonization, Ecological Informatics, 1,.355- 366.
Mousavi,S.M., Mahdavi,L., Rezaeian, J., Zandieh,M. (2018). Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times; Scientia Iranica E 25(4), 2233-2253.
Tamssaouet, K., Dauzère-Pérès, S., & Yugma, C. (2018). Metaheuristics for the job-shop scheduling problem with machine availability constraints; Computers & Industrial Engineering 125: 1–8.
Vahedi-Nouri, B., Fattahi, P., Tavakkoli-Moghaddam, R., and Ramezanian, R. (2014). A general flow shop scheduling problem with consideration of position-based learning effect and multiple availability constraints,  International Journal of Advanced Manufacturing Technology, 73 (5) ,601–611 (2014).
Vahedi-Nouri, B., Fattahi, P., & Ramezanian, R. (2013). Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities, International Journal ofProduction Research, 51(12), 3501-3515.
Velmurugan,T., Sibaram, k., Nadakumar,S., Saravanan,B. (2016). Seamless Vertical Handoff usingInvasive Weed Optimization (IWO) algorithm for heterogeneous wireless networks. Ain Shams Engineering journal, 7(1), 101-111.
Wagner, H.M. (1959). An integer linear-programming model for machine scheduling, Naval Rest Logis Q, 6 (2), 131–40.