## Abstract

This paper proposes a single machine scheduling problem with learning-effect and release times by considering two objectives requiring minimization of makespan and total tardiness, simultaneously. Due to the NP-hardness of this problem, two memetic algorithms with meme variants are presented for solving the bi-objective problem and applied by combining three different scalarization methods, including weighted sum, conic, and tchebycheff. The performance of all memetic algorithms with the meme is investigated across randomly generated twenty-seven test problems ranging from ‘small’ to ‘large’ size. The experimental results indicate that the Multimeme Memetic Algorithm using the tchebycheff outperforms the other algorithms producing the best-known results for almost all bi-objective single machine scheduling instances with learning-effects. All algorithms perform effectively in solving large-sized problems with up to 200 jobs.

### Similar content being viewed by others

## References

Ahmadizar F, Hosseini L (2012) Bi-criteria single machine scheduling with a time-dependent learning effect and release times. Appl Math Model 36:6203–6214

Amini A, Tavakkoli-Moghaddam R, Niakan F (2011) A multi-objective identical parallel machine scheduling with setup and removal times with deteriorating and learning effects. In: 2011 IEEE international conference on industrial engineering and engineering management, IEEE, pp 1271–1274

Amirian H, Sahraeian R (2015) Augmented \(\varepsilon \)-constraint method in multi-objective flowshop problem with past sequence set-up times and a modified learning effect. Int J Prod Res 53:5962–5976

Amirian H, Sahraeian R (2016) A hybrid differential evolution for general multi-objective flow shop problem with a modified learning effect. Proc Inst Mech Eng Part B J Eng Manuf 230:2275–2285

Arık OA, Toksarı MD (2018) Multi-objective fuzzy parallel machine scheduling problems under fuzzy job deterioration and learning effects. Int J Prod Res 56:2488–2505

Arroyo JEC, dos Santos Ottoni R, de Paiva Oliveira A (2011) Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows. Electron Notes Theor Comput Sci 281:5–19

Azadeh A, Ghaderi S, Dehghanbaghi M, Dabbaghi A (2010) Integration of simulation, design of experiment and goal programming for minimization of makespan and tardiness. Int J Adv Manuf Technol 46:431–444

Bai D, Xue H, Wang L, Wu C-C, Lin W-C, Abdulkadir DH (2020) Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates. Expert Syst Appl 156:113445

Baita F, Pesenti R, Ukovich W, Favaretto D (2000) A comparison of different solution approaches to the vehicle scheduling problem in a practical case. Comput Oper Res 27:1249–1269

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

Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178

Brandimarte P (1999) Exploiting process plan flexibility in production scheduling: a multi-objective approach. Eur J Oper Res 114:59–71

Branke J, Nguyen S, Pickardt CW, Zhang M (2015) Automated design of production scheduling heuristics: a review. IEEE Trans Evolut Comput 20:110–124

Braune R, Doerner KF (2017) Real-world flexible resource profile scheduling with multiple criteria: learning scalarization functions for MIP and heuristic approaches. J Oper Res Soc 68:952–972

Brockhoff D, Friedrich T, Neumann F (2008) Analyzing hypervolume indicator based algorithms. In: International conference on parallel problem solving from nature. Springer, pp 651–660

Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. In: Handbook of metaheuristics. Springer, pp 457–474

Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, Özcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64:1695–1724

Castellano D, Gallo M, Grassi A, Santillo LC (2019) Batching decisions in multi-item production systems with learning effect. Comput Ind Eng 131:578–591

Che A, Wu X, Peng J, Yan P (2017) Energy-efficient bi-objective single-machine scheduling with power-down mechanism. Comput Oper Res 85:172–183

Chen JC, Wu C-C, Chen C-W, Chen K-H (2012) Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm. Expert Syst Appl 39:10016–10021

Cheng M, Tadikamalla PR, Shang J, Zhang B (2015) Single machine scheduling problems with exponentially time-dependent learning effects. J Manuf Syst 34:60–65

Cheng TE, Ng C, Yuan J, Liu Z (2005) Single machine scheduling to minimize total weighted tardiness. Eur J Oper Res 165:423–443

Dalfard VM, Mohammadi G (2012) Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints. Comput Math Appl 64:2111–2117

Deliktas D, Torkul O, Ustun O (2019) A flexible job shop cell scheduling with sequence-dependent family setup times and intercellular transportation times using conic scalarization method. Int Trans Oper Res 26:2410–2431

Dolgui A, Gordon V, Strusevich V (2012) Single machine scheduling with precedence constraints and positionally dependent processing times. Comput Oper Res 39:1218–1224

Drake JH, Kheiri A, Özcan E, Burke EK (2020) Recent advances in selection hyper-heuristics. Eur J Oper Res 285:405–428

Du J, Leung JY-T (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483–495

D’Ariano A, Meng L, Centulio G, Corman F (2019) Integrated stochastic optimization approaches for tactical scheduling of trains and railway infrastructure maintenance. Comput Ind Eng 127:1315–1335

Ehrgott M (2006) A discussion of scalarization techniques for multiple objective integer programming. Ann Oper Res 147:343–360

Eren T (2009) Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect. Appl Math Comput 208:355–358

Eren T, Güner E (2007) Minimizing total tardiness in a scheduling problem with a learning effect. Appl Math Model 31:1351–1361

Fu Y, Ding J, Wang H, Wang J (2018) Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in industry 4.0-based manufacturing system. Appl Soft Comput 68:847–855

Gasimov RN (2001) Characterization of the benson proper efficiency and scalarization in nonconvex vector optimization. In: Multiple criteria decision making in the new millennium. Springer, pp 189–198

Goldberg DE, Lingle R, et al (1985) Alleles, loci, and the traveling salesman problem. In: Proceedings of an international conference on genetic algorithms and their applications, vol 154. Carnegie-Mellon University Pittsburgh, PA, pp 154–159

Hoseinpour Z, Kheirkhah AS, Fattahi P, Taghipour M (2020) The problem solving of bi-objective hybrid production with the possibility of production outsourcing through meta-heuristic algorithms. Management 4:1–17

Hosseini N, Tavakkoli-Moghaddam R (2013) Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals. Int J Adv Manuf Technol 65:771–786

İşler MC, Toklu B, Çelik V (2012) Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect. Int J Adv Manuf Technol 61:1129–1137

Ji M, Yao D, Yang Q, Cheng T (2015) Machine scheduling with dejong’s learning effect. Comput Ind Eng 80:195–200

Jiang Z, Chen F, Kang H (2013) Single-machine scheduling problems with actual time-dependent and job-dependent learning effect. Eur J Oper Res 227:76–80

Kan AR (2012) Machine scheduling problems: classification, complexity and computations. Springer

Kasimbeyli R (2010) A nonlinear cone separation theorem and scalarization in nonconvex vector optimization. SIAM J Optim 20:1591–1619

Kasimbeyli R (2013) A conic scalarization method in multi-objective optimization. J Global Optim 56:279–297

Kheiri A, Özcan E (2016) An iterated multi-stage selection hyper-heuristic. Eur J Oper Res 250:77–90

Krasnogor N, Smith J (2001) Emergence of profitable search strategies based on a simple inheritance mechanism. In: Proceedings of the 3rd annual conference on genetic and evolutionary computation, pp 432–439

Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Trans Evolut Comput 9(5):474–488

Kurdi M (2020) A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem. Appl Soft Comput 94:106458

Lai P-J, Lee W-C (2013) Single-machine scheduling with learning and forgetting effects. Appl Math Model 37:4509–4516

Lee W-C (2011) A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time. Comput Math Appl 62:2095–2100

Li Y, Yang X, Yang Z (2019) Uncertain learning curve and its application in scheduling. Comput Ind Eng 131:534–541

Li Y, Yu J, Tao D (2014) Genetic algorithm for spanning tree construction in p2p distributed interactive applications. Neurocomputing 140:185–192

Liang Y-C, Hsiao Y-M, Tien C-Y (2013) Metaheuristics for drilling operation scheduling in Taiwan PCB industries. Int J Prod Econ 141:189–198

Lin J, Zhu L, Gao K (2020) A genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Expert Syst Appl 140:112915

Lin R, Liao C-J (2012) A case study of batch scheduling for an assembly shop. Int J Prod Econ 139:473–483

Low C, Lin W-Y (2011) Minimizing the total completion time in a single-machine scheduling problem with a learning effect. Appl Math Model 35:1946–1951

Low C, Lin W-Y (2013) Some scheduling problems with time-dependent learning effect and deteriorating jobs. Appl Math Model 37:8865–8875

Lu Y-Y, Wang J-B (2013) Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times. Appl Math Model 37:6695–6702

Lu Y-Y, Wang J-J, Huang X (2015) Scheduling jobs with position and sum-of-processing-time based processing times. Appl Math Model 39:4013–4021

Lu Y-Y, Wei C-M, Wang J-B (2012) Several single-machine scheduling problems with general learning effects. Appl Math Model 36:5650–5656

Makhadmeh SN, Khader AT, Al-Betar MA, Naim S, Abasi AK, Alyasseri ZAA (2021) A novel hybrid grey wolf optimizer with min-conflict algorithm for power scheduling problem in a smart home. Swarm Evolut Comput 60:100793

Marichelvam M, Geetha M, Tosun Ö (2020) An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors-a case study. Comput Oper Res 114:104812

Marler RT, Arora JS (2005) Function-transformation methods for multi-objective optimization. Eng Optim 37:551–570

Miettinen K (2012) Nonlinear multiobjective optimization, vol 12. Springer

Mohammadi S, PourKarimi L, Pedram H (2019) Integer linear programming-based multi-objective scheduling for scientific workflows in multi-cloud environments. J Supercomput 75:6683–6709

Moscato P et al (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. In: Caltech concurrent computation program, C3P Report, vol 826

Mosheiov G (2001a) Parallel machine scheduling with a learning effect. J Oper Res Soc 52:1165–1169

Mosheiov G (2001b) Scheduling problems with a learning effect. Eur J Oper Res 132:687–693

Mousavi S, Mahdavi I, Rezaeian J, Zandieh M (2018a) Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times. Sci Iran 25:2233–2253

Mousavi S, Mahdavi I, Rezaeian J, Zandieh M (2018b) An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times. Oper Res 18:123–158

Mustu S, Eren T (2018) The single machine scheduling problem with sequence-dependent setup times and a learning effect on processing times. Appl Soft Comput 71:291–306

Nalepa J, Blocho M (2015) Co-operation in the parallel memetic algorithm. Int J Parallel Program 43:812–839

Nalepa J, Cwiek M, Kawulok M (2015) Adaptive memetic algorithm for the job shop scheduling problem. In: 2015 international joint conference on neural networks (IJCNN), IEEE, pp 1–8

Nalepa J, Czech ZJ (2013) New selection schemes in a memetic algorithm for the vehicle routing problem with time windows. In: International conference on adaptive and natural computing algorithms. Springer, pp 396–405

Nalepa J, Kawulok M (2014) A memetic algorithm to select training data for support vector machines. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation, pp 573–580

Ong Y-S, Lim M-H, Zhu N, Wong K-W (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern Part B (Cybernetics) 36:141–152

Oron D (2016) Scheduling controllable processing time jobs with position-dependent workloads. Int J Prod Econ 173:153–160

Özcan E, Drake JH, Altıntaş C, Asta S (2016) A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings. Appl Soft Comput 49:81–93

Özcan E, Misir M, Ochoa G, Burke EK (2012) A reinforcement learning: great-deluge hyper-heuristic for examination timetabling. In: Modeling, analysis, and applications in metaheuristic computing: advancements and trends. IGI Global, pp 34–55

Özcan E, Onbaşioğlu E (2007) Memetic algorithms for parallel code optimization. Int J Parallel Program 35:33–61

Pakzad-Moghaddam S (2016) A Lévy flight embedded particle swarm optimization for multi-objective parallel-machine scheduling with learning and adapting considerations. Comput Ind Eng 91:109–128

Pakzad-Moghaddam S, Mina H, Tavakkoli-Moghaddam R (2014) An approach for modeling a new single machine scheduling problem with deteriorating and learning effects. Comput Ind Eng 78:33–43

Pargar F, Zandieh M, Kauppila O, Kujala J (2018) The effect of worker learning on scheduling jobs in a hybrid flow shop: a bi-objective approach. J Syst Sci Syst Eng 27:265–291

Pei J, Liu X, Liao B, Pardalos PM, Kong M (2018) Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production. Appl Math Model 58:245–253

Piroozfard H, Wong KY, Wong WP (2018) Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm. Resour Conserv Recycl 128:267–283

Qian J, Lin H, Kong Y, Wang Y (2019) Tri-criteria single machine scheduling model with release times and learning factor. Appl Math Comput 387:124543

Qin Y, Wang H, Yi S, Li X, Zhai L (2020) An energy-aware scheduling algorithm for budget-constrained scientific workflows based on multi-objective reinforcement learning. J Supercomput 76:455–480

Rostami M, Pilerood AE, Mazdeh MM (2015) Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment. Comput Ind Eng 85:206–215

Roy SK, Maity G, Weber GW, Gök SZA (2017) Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal. Ann Oper Res 253:599–620

Rudek R (2017) The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard. Appl Math Model 50:314–332

Sahraeian R, Amirian H (2014) Multi-objective differential evolution for the flow shop scheduling problem with a modified learning effect. Int J Eng 27:1395–1404

Shen L, Wu Y-B (2013) Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects. Appl Math Model 37:5444–5451

Soleimani H, Ghaderi H, Tsai P-W, Zarbakhshnia N, Maleki M (2020) Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization. J Clean Prod 249:119428

Song H-B, Lin J (2021) A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times. Swarm Evolut Comput 60:100807

Steuer RE, Choo E-U (1983) An interactive weighted tchebycheff procedure for multiple objective programming. Math Program 26:326–344

Steuer RE, Steuer R (1986) Multiple criteria optimization: theory, computation, and application, vol 233. Wiley, New York

Sun L, Yu AJ, Wu B (2020) Single machine common flow allowance group scheduling with learning effect and resource allocation. Comput Ind Eng 139:106126

Syswerda G (1991) Scheduling optimization using genetic algorithms. In: Handbook of genetic algorithms

Taghavi-farda M, Javanshir H, Roueintan M, Soleimany E (2011) Multi-objective group scheduling with learning effect in the cellular manufacturing system. Int J Ind Eng Comput 2:617–630

Taghizadehalvandi M, Kamisli Ozturk Z (2019) Multi-objective solution approaches for employee shift scheduling problems in service sectors (research note). Int J Eng 32:1312–1319

Tirkolaee EB, Aydın NS, Ranjbar-Bourani M, Weber G-W (2020a) A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect. Comput Ind Eng 149:106790

Tirkolaee EB, Goli A, Weber G-W (2020b) Fuzzy mathematical programming and self-adaptive artificial fish swarm algorithm for just-in-time energy-aware flow shop scheduling problem with outsourcing option. IEEE Trans Fuzzy Syst 28:2772–2783

Toksarı MD (2011) A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs. Comput Oper Res 38:1361–1365

Toksari MD, Arık OA (2017) Single machine scheduling problems under position-dependent fuzzy learning effect with fuzzy processing times. J Manuf Syst 45:159–179

Vahedi-Nouri B, Fattahi P, Rohaninejad M, Tavakkoli-Moghaddam R (2013) Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints. Appl Math Model 37:3126–3137

Wan L, Yuan J (2013) Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper Res Lett 41:363–365

Wang J-B, Wang C (2011a) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35:4017–4022

Wang J-B, Wang J-J (2011b) Single-machine scheduling jobs with exponential learning functions. Comput Ind Eng 60:755–759

Wang X-Y, Wang J-J (2013) Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning. Appl Math Model 37:4905–4914

Wierzbicki AP (1986) On the completeness and constructiveness of parametric characterizations to vector optimization problems. Oper Res Spektrum 8:73–87

Wu C-C, Bai D, Chen J-H, Lin W-C, Xing L, Lin J-C, Cheng S-R (2020) Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. Swarm Evolut Comput 60:100765

Wu C-H, Lai P-J, Lee W-C (2015) A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects. Appl Math Model 39:415–424

Wu C-H, Lee W-C, Lai P-J, Wang J-Y (2016) Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects. Discrete Optim 19:1–11

Wu S-J, Chow P-T (1994) Genetic algorithms for solving mixed-discrete optimization problems. J Franklin Inst 331:381–401

Xingong Z, Yong W (2015) Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect. Appl Math Comput 250:628–635

Xu J, Wu C-C, Yin Y, Lin W-C (2017) An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times. Appl Soft Comput 52:39–47

Xue P, Zhang Y, Yu X (2014) Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times. Appl Math Comput 226:415–422

Yang J-H, Sun L, Lee HP, Qian Y, Liang Y-C (2008) Clonal selection based memetic algorithm for job shop scheduling problems. J Bionic Eng 5:111–119

Yang S-J (2012) Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration. Comput Ind Eng 62:271–275

Yin Y, Wu W-H, Wu W-H, Wu C-C (2014) A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf Sci 256:91–108

Yue L, Guan Z, Saif U, Zhang F, Wang H (2016) Hybrid pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects. SpringerPlus 5:1593

Zhang L, Lu L, Yuan J (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975–978

Zhu Z, Chu F, Sun L, Liu M (2013) Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity. Appl Math Model 37:5371–5380

Zitzler E, Thiele L (1998a) An evolutionary algorithm for multiobjective optimization: the strength pareto approach. TIK-report, 43

Zitzler E, Thiele L (1998b) Multiobjective optimization using evolutionary algorithms—a comparative case study. In: International conference on parallel problem solving from nature. Springer, pp 292–301

## Acknowledgements

The authors would like to thank the Department of Computer Science at Yalova University for the laboratory support in conducting large-sized experiments. Authors wish to acknowledge the anonymous referees for their comments to improve the presentation of this paper.

## Author information

### Authors and Affiliations

### Corresponding author

## Ethics declarations

### Conflict of interest

No potential conflict of interest was reported by the author(s).

## Additional information

### Publisher's Note

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

## Rights and permissions

## About this article

### Cite this article

Deliktaş, D. Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times.
*Flex Serv Manuf J* **34**, 748–784 (2022). https://doi.org/10.1007/s10696-021-09434-7

Accepted:

Published:

Issue Date:

DOI: https://doi.org/10.1007/s10696-021-09434-7