{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T19:27:19Z","timestamp":1781292439973,"version":"3.54.1"},"reference-count":75,"publisher":"Vilnius University Press","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p>This paper models and solves the scheduling problem of cable manufacturing industries that minimizes the total production cost, including processing, setup, and storing costs. Two hybrid meta-heuristics, which combine simulated annealing and variable neighbourhood search algorithms with tabu search algorithm, are proposed. Applying some case-based theorems and rules, a special initial solution with optimal setup cost is obtained for the algorithms. The computational experiments, including parameter tuning and final experiments over the benchmarks obtained from a real cable manufacturing factory, show superiority of the combination of tabu search and simulated annealing comparing to the other proposed hybrid and classical meta-heuristics.<\/jats:p>","DOI":"10.15388\/21-infor471","type":"journal-article","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T12:21:12Z","timestamp":1641298872000},"page":"499-522","source":"Crossref","is-referenced-by-count":22,"title":["Tabu Search Based Hybrid Meta-Heuristic Approaches for Schedule-Based Production Cost Minimization Problem for the Case of Cable Manufacturing Systems"],"prefix":"10.15388","author":[{"given":"Fereshteh","family":"Daneshdoost","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9988-2626","authenticated-orcid":false,"given":"Mostafa","family":"Hajiaghaei-Keshteli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramazan","family":"Sahin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sadegh","family":"Niroomand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"6097","published-online":{"date-parts":[[2022,1,4]]},"reference":[{"key":"2022092811184216218_j_infor471_ref_001","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","article-title":"A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms","volume":"73","year":"2016","journal-title":"Computers & Operations Research"},{"key":"2022092811184216218_j_infor471_ref_002","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.eswa.2016.05.014","article-title":"A multi-objectives scheduling algorithm based on cuckoo optimization for task allocation problem at compile time in heterogeneous systems","volume":"60","year":"2016","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_003","first-page":"47","article-title":"Geometric operators based on linguistic interval-valued intuitionistic neutrosophic fuzzy number and their application in decision making","volume":"3","year":"2020","journal-title":"Ann Optim Theory Practices"},{"key":"2022092811184216218_j_infor471_ref_004","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","article-title":"A survey of scheduling problems with setup times or costs","volume":"187","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"2022092811184216218_j_infor471_ref_005","first-page":"15","article-title":"Scheduling an unbounded batching machine with job processing time compatibilities","volume":"160","year":"2012","journal-title":"Discrete Applied Mathematics"},{"key":"2022092811184216218_j_infor471_ref_006","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/j.jclepro.2016.03.150","article-title":"An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs","volume":"129","year":"2016","journal-title":"Journal of Cleaner Production"},{"key":"2022092811184216218_j_infor471_ref_007","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.compchemeng.2013.08.003","article-title":"Integration of production scheduling and dynamic optimization for multi-product CSTRs: generalized benders decomposition coupled with global mixed-integer fractional programming","volume":"58","year":"2013","journal-title":"Computers & Chemical Engineering"},{"key":"2022092811184216218_j_infor471_ref_008","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.compchemeng.2013.09.004","article-title":"Hybrid method integrating agent-based modeling and heuristic tree search for scheduling of complex batch processes","volume":"60","year":"2014","journal-title":"Computers & Chemical Engineering"},{"key":"2022092811184216218_j_infor471_ref_009","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.compchemeng.2012.05.008","article-title":"A novel hybrid differential evolution approach to scheduling of large-scale zero-wait batch processes with setup times","volume":"45","year":"2012","journal-title":"Computers & Chemical Engineering"},{"issue":"4","key":"2022092811184216218_j_infor471_ref_010","doi-asserted-by":"crossref","first-page":"629","DOI":"10.15388\/Informatica.2019.222","article-title":"Improving statistical machine translation quality using differential evolution","volume":"30","year":"2019","journal-title":"Informatica"},{"issue":"9\u201310","key":"2022092811184216218_j_infor471_ref_011","first-page":"2490","article-title":"Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates","volume":"38","year":"2014","journal-title":"Applied Mathematical Modelling"},{"issue":"8","key":"2022092811184216218_j_infor471_ref_012","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.ipl.2016.03.010","article-title":"Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine","volume":"116","year":"2016","journal-title":"Information Processing Letters"},{"issue":"2","key":"2022092811184216218_j_infor471_ref_013","first-page":"205","article-title":"A discrete competitive facility location model with minimal market share constraints and equity-based ties breaking rule","volume":"31","year":"2020","journal-title":"Informatica"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_014","first-page":"43","article-title":"Emergency response time minimization by incorporating ground and aerial transportation","volume":"1","year":"2018","journal-title":"Annals of Optimization Theory and Practice"},{"key":"2022092811184216218_j_infor471_ref_015","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2013.11.002","article-title":"Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations","volume":"44","year":"2014","journal-title":"Computers & Operations Research"},{"key":"2022092811184216218_j_infor471_ref_016","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/0952813X.2020.1725651","article-title":"Improved butterfly optimisation algorithm based on guiding weight and population restart","volume":"33","year":"2020","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"key":"2022092811184216218_j_infor471_ref_017","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.asoc.2014.09.034","article-title":"Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm","volume":"25","year":"2014","journal-title":"Applied Soft Computing"},{"key":"2022092811184216218_j_infor471_ref_018","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.cie.2014.05.026","article-title":"Integrated scheduling of production and rail transportation","volume":"74","year":"2014","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_019","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1016\/j.ejor.2015.02.026","article-title":"A soft-decision based two-layered scheduling approach for uncertain steelmaking-continuous casting process","volume":"244","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2022092811184216218_j_infor471_ref_020","first-page":"37","article-title":"Classification of seven Iranian recycling industries using MCDM models","volume":"3","year":"2020","journal-title":"Annals of Optimization Theory and Practice"},{"key":"2022092811184216218_j_infor471_ref_021","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2016.01.021","article-title":"Scheduling two parallel machines with machine-dependent availabilities","volume":"72","year":"2016","journal-title":"Computers & Operations Research"},{"key":"2022092811184216218_j_infor471_ref_022","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2020.1725652","article-title":"Bi-objective web service composition problem in multi-cloud environment: a bi-objective time-varying particle swarm optimisation algorithm","year":"2020","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"key":"2022092811184216218_j_infor471_ref_023","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1007\/s10489-017-0935-y","article-title":"A hybrid and scalable multi-agent approach for patient scheduling based on Petri net models","volume":"47","year":"2017","journal-title":"Applied Intelligence"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_024","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/s10489-015-0701-y","article-title":"A swarm intelligent method for traffic light scheduling: application to real urban traffic networks","volume":"44","year":"2016","journal-title":"Applied Intelligence"},{"issue":"4","key":"2022092811184216218_j_infor471_ref_025","first-page":"83","article-title":"Average operators based on spherical cubic fuzzy number and their application in multi-attribute decision making","volume":"3","year":"2020","journal-title":"Annals of Optimization Theory and Practice"},{"key":"2022092811184216218_j_infor471_ref_026","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.eswa.2016.01.054","article-title":"Robust job shop scheduling problem: mathematical models, exact and heuristic algorithms","volume":"55","year":"2016","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"2022092811184216218_j_infor471_ref_027","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.cie.2013.08.020","article-title":"Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity","volume":"66","year":"2013","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_028","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2013.06.021","article-title":"Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach","volume":"231","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"2022092811184216218_j_infor471_ref_029","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1016\/j.cor.2011.12.011","article-title":"MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server","volume":"39","year":"2012","journal-title":"Computers & Operations Research"},{"key":"2022092811184216218_j_infor471_ref_030","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","year":"1983","journal-title":"Science"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_031","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ejor.2016.01.010","article-title":"The proportionate two-machine no-wait job shop scheduling problem","volume":"252","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"2022092811184216218_j_infor471_ref_032","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","article-title":"Mixed integer programming models for job shop scheduling: a computational analysis","volume":"73","year":"2016","journal-title":"Computers & Operations Research"},{"key":"2022092811184216218_j_infor471_ref_033","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cie.2015.07.015","article-title":"A new hybrid island model genetic algorithm for job shop scheduling problem","volume":"88","year":"2015","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_034","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.ejor.2012.05.029","article-title":"A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty","volume":"222","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2022092811184216218_j_infor471_ref_035","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.cie.2012.05.003","article-title":"Uniform parallel-machine scheduling to minimize makespan with position-based learning curves","volume":"63","year":"2012","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"2022092811184216218_j_infor471_ref_036","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.ijmst.2014.10.004","article-title":"Stochastic optimization of mine production scheduling with uncertain ore\/metal\/waste supply","volume":"24","year":"2014","journal-title":"International Journal of Mining Science and Technology"},{"key":"2022092811184216218_j_infor471_ref_037","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","year":"2016","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"2022092811184216218_j_infor471_ref_038","first-page":"181","article-title":"Penalty cost constrained identical parallel machine scheduling problem","volume":"607","year":"2015","journal-title":"Theoretical Computer Science"},{"key":"2022092811184216218_j_infor471_ref_039","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cie.2014.04.013","article-title":"Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times","volume":"74","year":"2014","journal-title":"Computers & Industrial Engineering"},{"key":"2022092811184216218_j_infor471_ref_040"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_041","doi-asserted-by":"crossref","first-page":"503","DOI":"10.15388\/Informatica.2019.216","article-title":"An effective hybrid fuzzy programming approach for an entropy-based multi-objective assembly line balancing problem","volume":"30","year":"2019","journal-title":"Informatica"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_042","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ejor.2016.02.045","article-title":"A multi-agent based cooperative approach to scheduling and routing","volume":"254","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"2022092811184216218_j_infor471_ref_043","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.eswa.2016.06.014","article-title":"Correlation of job-shop scheduling problem features with scheduling efficiency","volume":"62","year":"2016","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_044","doi-asserted-by":"crossref","first-page":"499","DOI":"10.15388\/Informatica.2018.178","article-title":"Some further experiments with crossover operators for genetic algorithms","volume":"29","year":"2018","journal-title":"Informatica"},{"key":"2022092811184216218_j_infor471_ref_045","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cor.2013.08.007","article-title":"Batch scheduling of identical jobs with controllable processing times","volume":"41","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_046","first-page":"35","article-title":"Toward a continuum of measurement scales in Just-in-Time (JIT) research \u2013 an examination of the predictive validity of single-item and multiple-item measures","volume":"9","year":"2016","journal-title":"Operations Management Research"},{"key":"2022092811184216218_j_infor471_ref_047","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1111\/itor.12096","article-title":"Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry","volume":"22","year":"2015","journal-title":"International Transactions in Operational Research"},{"issue":"8","key":"2022092811184216218_j_infor471_ref_048","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1080\/0951192X.2015.1130244","article-title":"Hybrid greedy algorithms for fuzzy tardiness\/earliness minimization in a special single machine scheduling problem: case study and generalisation","volume":"29","year":"2016","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"6","key":"2022092811184216218_j_infor471_ref_049","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1007\/s12652-018-0804-5","article-title":"A hybrid approach for multi-criteria emergency center location problem considering existing emergency centers with interval type data: a case study","volume":"9","year":"2018","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_050","article-title":"A hybrid solution approach for fuzzy multiobjective dual supplier and material selection problem of carton box production systems","volume":"36","year":"2019","journal-title":"Expert Systems"},{"issue":"10","key":"2022092811184216218_j_infor471_ref_051","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1016\/j.engappai.2013.07.011","article-title":"An improved intelligent water drops algorithm for solving multi-objective job shop scheduling","volume":"26","year":"2013","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2022092811184216218_j_infor471_ref_052","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ijepes.2013.01.003","article-title":"AC constrained hydro-thermal generation scheduling problem: Application of Benders decomposition method improved by BFPSO","volume":"49","year":"2013","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"2022092811184216218_j_infor471_ref_053","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2014.08.068","article-title":"Bi-objective optimization of a multi-product multi-period three-echelon supply chain problem under uncertain environments: NSGA-II and NRGA","volume":"292","year":"2015","journal-title":"Information Sciences"},{"key":"2022092811184216218_j_infor471_ref_054","volume-title":"Scheduling: Theory, Algorithms, and Systems","year":"2008","edition":"3"},{"issue":"8","key":"2022092811184216218_j_infor471_ref_055","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","article-title":"Faster algorithms for single machine scheduling with release dates and rejection","volume":"116","year":"2016","journal-title":"Information Processing Letters"},{"issue":"2","key":"2022092811184216218_j_infor471_ref_056","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10489-017-0908-1","article-title":"Clustering technique for large-scale home care crew scheduling problems","volume":"47","year":"2017","journal-title":"Applied Intelligence"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_057","first-page":"98","article-title":"Hierarchical composition heuristic for asymmetric sequence dependent single machine scheduling problems","volume":"3","year":"2010","journal-title":"Operations Management Research"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_058","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.jmsy.2013.03.004","article-title":"Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times","volume":"33","year":"2014","journal-title":"Journal of Manufacturing Systems"},{"key":"2022092811184216218_j_infor471_ref_059","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.asoc.2015.04.027","article-title":"A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem","volume":"33","year":"2015","journal-title":"Applied Soft Computing"},{"issue":"16","key":"2022092811184216218_j_infor471_ref_060","doi-asserted-by":"crossref","first-page":"4973","DOI":"10.1080\/00207543.2016.1154214","article-title":"The economic lot scheduling problem: a survey","volume":"54","year":"2016","journal-title":"International Journal of Production Research"},{"issue":"11","key":"2022092811184216218_j_infor471_ref_061","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1016\/j.cjche.2015.08.017","article-title":"A novel two-stage Lagrangian decomposition approach for refinery production scheduling with operational transitions in mode switching","volume":"23","year":"2015","journal-title":"Chinese Journal of Chemical Engineering"},{"key":"2022092811184216218_j_infor471_ref_062","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.measurement.2015.07.013","article-title":"OPAIC: an optimization technique to improve energy consumption and performance in application specific network on chips","volume":"74","year":"2015","journal-title":"Measurement"},{"issue":"4","key":"2022092811184216218_j_infor471_ref_063","first-page":"356","article-title":"Multi-stage supply chain network solution methods: hybrid metaheuristics and performance measurement","volume":"5","year":"2018","journal-title":"International Journal of Systems Science: Operations & Logistics"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_064","first-page":"69","article-title":"Policy decision making based on some averaging aggregation operators of t-spherical fuzzy sets; a multi-attribute decision making approach","volume":"3","year":"2020","journal-title":"Annals of Optimization Theory and Practice"},{"issue":"13","key":"2022092811184216218_j_infor471_ref_065","doi-asserted-by":"crossref","first-page":"3793","DOI":"10.1080\/00207543.2014.888789","article-title":"Scheduling unrelated machines with two types of jobs","volume":"52","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"3","key":"2022092811184216218_j_infor471_ref_066","first-page":"15","article-title":"Local search based meta-heuristic algorithms for optimizing the cyclic flexible manufacturing cell problem","volume":"1","year":"2018","journal-title":"Annals of Optimization Theory and Practice"},{"key":"2022092811184216218_j_infor471_ref_067","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.orl.2013.04.007","article-title":"Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard","volume":"41","year":"2013","journal-title":"Operations Research Letters"},{"issue":"1","key":"2022092811184216218_j_infor471_ref_068","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ejor.2015.01.034","article-title":"A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem","volume":"244","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"2022092811184216218_j_infor471_ref_069","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.ins.2013.06.054","article-title":"Single-machine scheduling with two competing agents and learning consideration","volume":"251","year":"2013","journal-title":"Information Sciences"},{"key":"2022092811184216218_j_infor471_ref_070","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cor.2015.04.010","article-title":"A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times","volume":"63","year":"2015","journal-title":"Computers & Operations Research"},{"key":"2022092811184216218_j_infor471_ref_071","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.cie.2016.05.037","article-title":"Exact algorithms for single-machine scheduling problems with a variable maintenance","volume":"98","year":"2016","journal-title":"Computers & Industrial Engineering"},{"key":"2022092811184216218_j_infor471_ref_072","first-page":"1","article-title":"Solving integrated process planning and scheduling problem with constructive meta-heuristics","volume":"340\u2013341","year":"2016","journal-title":"Information Sciences"},{"key":"2022092811184216218_j_infor471_ref_073","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/0952813X.2019.1673488","article-title":"An improved invasive weed optimization algorithm for solving dynamic economic dispatch problems with valve-point effects","volume":"32","year":"2020","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"key":"2022092811184216218_j_infor471_ref_074","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2016.05.014","article-title":"An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes","volume":"179","year":"2016","journal-title":"International Journal of Production Economics"},{"key":"2022092811184216218_j_infor471_ref_075","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.dam.2015.05.005","article-title":"Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness","volume":"196","year":"2015","journal-title":"Discrete Applied Mathematics"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1243\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1243\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T10:43:17Z","timestamp":1664361797000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/21-INFOR471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":75,"alternative-id":["10.15388\/21-INFOR471"],"URL":"https:\/\/doi.org\/10.15388\/21-infor471","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}