{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:51:01Z","timestamp":1759837861544},"reference-count":62,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1093\/comjnl\/bxx021","type":"journal-article","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T20:13:49Z","timestamp":1488399229000},"page":"14-31","source":"Crossref","is-referenced-by-count":9,"title":["A Multi-Machine Order Scheduling with Learning Using the Genetic Algorithm and Particle Swarm Optimization"],"prefix":"10.1093","volume":"61","author":[{"given":"Chin-Chia","family":"Wu","sequence":"first","affiliation":[]},{"given":"Shang-Chia","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chuanli","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Sheng-Zhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2017,3,17]]},"reference":[{"key":"key\n\t\t\t\t20180119051450_bxx021C1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single state production","volume":"3","year":"1956","journal-title":"Nav. Res. Logist. Quat."},{"key":"key\n\t\t\t\t20180119051450_bxx021C2","volume-title":"Scheduling: Theory, Algorithms, and Systems","year":"2002"},{"key":"key\n\t\t\t\t20180119051450_bxx021C3","article-title":"A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","article-title":"Single-machine scheduling with learning considerations","volume":"115","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1019216726076","article-title":"Single machine scheduling with learning effect considerations","volume":"98","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C6","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","article-title":"Single-machine and two-machine flowshop scheduling with general learning functions","volume":"178","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","article-title":"A state-of-the-art review on scheduling with learning effect","volume":"188","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C8","doi-asserted-by":"crossref","first-page":"3127","DOI":"10.1016\/j.ins.2009.05.002","article-title":"Single-machine scheduling with sum-of- logarithm- processing- times- based learning considerations","volume":"179","year":"2009","journal-title":"Inf. Sci. (Ny)"},{"issue":"10","key":"key\n\t\t\t\t20180119051450_bxx021C9","doi-asserted-by":"crossref","first-page":"2813","DOI":"10.1016\/j.apm.2009.12.015","article-title":"Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect","volume":"34","year":"2010","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180119051450_bxx021C10","doi-asserted-by":"crossref","first-page":"2068","DOI":"10.1016\/j.apm.2010.11.041","article-title":"Single-machine scheduling simultaneous with position- based and sum-of-processing-times-based learning considerations under group technology assumption","volume":"35","year":"2011","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180119051450_bxx021C11","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1007\/s10845-011-0525-5","article-title":"Ant colony algorithms for a two-agent scheduling with sum-of processing times- based learning and deteriorating considerations","volume":"23","year":"2012","journal-title":"J. Intell. Manuf."},{"key":"key\n\t\t\t\t20180119051450_bxx021C12","first-page":"8848","article-title":"Scheduling two agents with sum-of- processing-times-based deterioration on a single machine","volume":"219","year":"2013","journal-title":"Appl. Math. Comput."},{"key":"key\n\t\t\t\t20180119051450_bxx021C13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.ins.2012.09.001","article-title":"Scheduling with a position- weighted learning effect based on sum-of-logarithm-processing-times and job position","volume":"221","year":"2013","journal-title":"Inf. Sci. (Ny)"},{"key":"key\n\t\t\t\t20180119051450_bxx021C14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00170-013-4772-9","article-title":"Single machine scheduling jobs with a truncated sum- of-processing-times-based learning effect","volume":"67","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"key\n\t\t\t\t20180119051450_bxx021C15","first-page":"9 pages","article-title":"Competitive two-agent scheduling with learning effect and release times on a single machine","volume":"2013","year":"2013","journal-title":"Math. Intell. Manuf."},{"key":"key\n\t\t\t\t20180119051450_bxx021C16","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1016\/j.cie.2011.01.016","article-title":"Some single-machine scheduling problems with a truncation learning effect","volume":"60","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t20180119051450_bxx021C17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1504\/EJIE.2012.047665","article-title":"Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect","volume":"6","year":"2012","journal-title":"Eur. J. Ind. Eng."},{"key":"key\n\t\t\t\t20180119051450_bxx021C18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1057\/jors.2012.46","article-title":"Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions","volume":"64","year":"2013","journal-title":"J. Oper. Res. Soc."},{"key":"key\n\t\t\t\t20180119051450_bxx021C19","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","article-title":"Minimizing the total completion time in a single- machine scheduling problem with a time- dependent learning effect","volume":"174","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C20","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.cie.2010.12.008","article-title":"A two-agent single- machine scheduling problem with truncated sum- of- processing- times- based learning considerations","volume":"60","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t20180119051450_bxx021C21","doi-asserted-by":"crossref","first-page":"5001","DOI":"10.1016\/j.apm.2011.12.038","article-title":"A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function","volume":"36","year":"2012","journal-title":"Appl. Math. Model."},{"issue":"2","key":"key\n\t\t\t\t20180119051450_bxx021C22","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/hfm.20365","article-title":"A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem","volume":"24","year":"2014","journal-title":"Hum. Factors Ergon. Manuf. Serv. Ind."},{"key":"key\n\t\t\t\t20180119051450_bxx021C23","first-page":"2 pages","article-title":"Scheduling with time-dependent processing times","volume":"2014","year":"2014","journal-title":"Math. Probl. Eng."},{"key":"key\n\t\t\t\t20180119051450_bxx021C24","article-title":"Scheduling with time-depending processing times 2015","volume":"2015","year":"2015","journal-title":"Math Probl. Eng."},{"key":"key\n\t\t\t\t20180119051450_bxx021C25","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1080\/0951192X.2014.900872","article-title":"Single-machine scheduling with time-dependent and position-dependent deteriorating jobs","volume":"28","year":"2015","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"key\n\t\t\t\t20180119051450_bxx021C26","doi-asserted-by":"crossref","first-page":"2416","DOI":"10.1016\/j.ins.2009.02.015","article-title":"Some scheduling problems with general position-dependent and time-dependent learning effects","volume":"179","year":"2009","journal-title":"Inf. Sci. (Ny)"},{"key":"key\n\t\t\t\t20180119051450_bxx021C27","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.cor.2011.07.022","article-title":"The single-machine total weighted tardiness scheduling problem with position-based learning effects","volume":"39","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C28","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TSMCA.2011.2147305","article-title":"Single- machine scheduling with job-position-dependent learning and time-dependent deterioration","volume":"42","year":"2012","journal-title":"IEEE Trans. Syst. Man Cybern. A Syst. Hum."},{"key":"key\n\t\t\t\t20180119051450_bxx021C29","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.ins.2012.01.018","article-title":"Notes on \u2018Scheduling problems with general effects of deterioration and learning\u2019","volume":"195","year":"2012","journal-title":"Inf. Sci. (Ny)"},{"key":"key\n\t\t\t\t20180119051450_bxx021C30","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/nav.20092","article-title":"Coordinated scheduling of customer orders for quick response","volume":"52","year":"2005","journal-title":"Nav. Res. Logist."},{"key":"key\n\t\t\t\t20180119051450_bxx021C31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0925-5273(97)00151-5","article-title":"Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines","volume":"54","year":"1998","journal-title":"Int. J. Prod. Econ."},{"key":"key\n\t\t\t\t20180119051450_bxx021C32","first-page":"623","article-title":"Customer order scheduling to minimize total weighted completion time","volume":"35","year":"2007","journal-title":"Omega (Westport)"},{"key":"key\n\t\t\t\t20180119051450_bxx021C33","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","article-title":"Order scheduling in an environment with dedicated resources in parallel","volume":"8","year":"2005","journal-title":"J. Sched."},{"key":"key\n\t\t\t\t20180119051450_bxx021C34","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","article-title":"Scheduling orders for multiple product types to minimize total weighted completion time","volume":"155","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t20180119051450_bxx021C35","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10479-007-0270-5","article-title":"Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time","volume":"159","year":"2008","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C36","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ijpe.2004.03.005","article-title":"Fixed pre-assembly scheduling on multiple fabrication machines","volume":"96","year":"2005","journal-title":"Int. J. Prod. Econ."},{"key":"key\n\t\t\t\t20180119051450_bxx021C37","article-title":"Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times","year":"2016","journal-title":"Appl. Soft Comput"},{"key":"key\n\t\t\t\t20180119051450_bxx021C38","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.ejor.2004.03.030","article-title":"Scheduling orders for multiple product types with due date related objectives","volume":"168","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C39","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ijpe.2013.01.025","article-title":"Minimizing total tardiness for the order scheduling problem","volume":"144","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"key\n\t\t\t\t20180119051450_bxx021C40","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cor.2016.04.021","article-title":"An order scheduling problem with position-based learning effect","volume":"74","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C41","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-005-5315-5","article-title":"Scheduling parallel machines for the customer order problem","volume":"8","year":"2005","journal-title":"J. Sched."},{"key":"key\n\t\t\t\t20180119051450_bxx021C42","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/nav.20138","article-title":"Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel","volume":"53","year":"2006","journal-title":"Nav. Res. Logist."},{"key":"key\n\t\t\t\t20180119051450_bxx021C43","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ipl.2007.03.002","article-title":"Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines","volume":"103","year":"2007","journal-title":"Inf. Proces. Lett."},{"key":"key\n\t\t\t\t20180119051450_bxx021C44","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ejor.2007.05.052","article-title":"Preemptive multiprocessor order scheduling to minimize total weighted flowtime","volume":"190","year":"2008","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"key\n\t\t\t\t20180119051450_bxx021C45","doi-asserted-by":"crossref","first-page":"2268","DOI":"10.1080\/00207543.2012.716172","article-title":"Minimizing general setup costs in a two-stage production system","volume":"51","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C46","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.ejor.2006.10.021","article-title":"Customer order scheduling to minimize the number of late jobs","volume":"183","year":"2007","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"key\n\t\t\t\t20180119051450_bxx021C47","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10479-006-0065-0","article-title":"Setup coordination between two stages of a production system: a multi-objective evolutionary approach","volume":"147","year":"2006","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"key\n\t\t\t\t20180119051450_bxx021C48","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10845-005-6641-3","article-title":"Single and multi-objective evolutionary algorithms for the coordination of serial manufacturing operations","volume":"17","year":"2006","journal-title":"J. Intell. Manuf."},{"issue":"12","key":"key\n\t\t\t\t20180119051450_bxx021C49","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1093\/comjnl\/bxw043","article-title":"An orthogonal genetic algorithm for QoS-aware service composition","volume":"59","year":"2016","journal-title":"Comput. J."},{"issue":"2","key":"key\n\t\t\t\t20180119051450_bxx021C50","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1093\/comjnl\/bxv088","article-title":"Towards better traffic localization of virtual LANs using genetic algorithm","volume":"59","year":"2016","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180119051450_bxx021C51","volume-title":"Adaptation in Natural and Artificial Systems","year":"1975"},{"key":"key\n\t\t\t\t20180119051450_bxx021C52","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","article-title":"A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem","volume":"35","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"key\n\t\t\t\t20180119051450_bxx021C53","first-page":"117","article-title":"Solving matrix game with rough payoffs using genetic algorithm","volume":"16","year":"2016","journal-title":"Oper. Res."},{"key":"key\n\t\t\t\t20180119051450_bxx021C54","first-page":"824","year":"1991"},{"key":"key\n\t\t\t\t20180119051450_bxx021C55","year":"1998"},{"key":"key\n\t\t\t\t20180119051450_bxx021C56","volume-title":"Swarm Intelligence","year":"2001"},{"key":"key\n\t\t\t\t20180119051450_bxx021C57","year":"2007"},{"key":"key\n\t\t\t\t20180119051450_bxx021C58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2008\/587309","article-title":"Analysis of the publications on the applications of particle swarm optimisation","volume":"2008","year":"2008","journal-title":"J. Artif. Evol. Appl."},{"key":"key\n\t\t\t\t20180119051450_bxx021C59","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.asoc.2014.01.035","article-title":"Hybrid bare-bones PSO for dynamic economic dispatch with valve-point effects","volume":"18","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"key\n\t\t\t\t20180119051450_bxx021C60","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.asoc.2014.10.015","article-title":"A self-adaptive PSO for joint lot sizing and job shop scheduling with compressible process times","volume":"27","year":"2015","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"key\n\t\t\t\t20180119051450_bxx021C61","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1093\/comjnl\/bxw062","article-title":"A fuzzy based energy-aware clustering architecture for cooperative communication in WSN","volume":"59","year":"2016","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180119051450_bxx021C62","volume-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop","year":"1982"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/1\/14\/23571898\/bxx021.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T11:24:36Z","timestamp":1516361076000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/61\/1\/14\/3073680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,17]]},"references-count":62,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,3,17]]},"published-print":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx021","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,1]]},"published":{"date-parts":[[2017,3,17]]}}}