{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T05:22:22Z","timestamp":1776835342885,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s11227-013-0986-8","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T10:59:00Z","timestamp":1374058740000},"page":"69-83","source":"Crossref","is-referenced-by-count":50,"title":["A heuristic algorithm for the distributed and flexible job-shop scheduling problem"],"prefix":"10.1007","volume":"67","author":[{"given":"Mohsen","family":"Ziaee","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,18]]},"reference":[{"key":"986_CR1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.rcim.2005.11.005","volume":"22","author":"FTS Chan","year":"2006","unstructured":"Chan FTS, Chung SH, Chan LY, Finke G, Tiwari MK (2006) Solving distributed FMS scheduling problems subject to maintenance: genetic algorithms approach. Robot Comput-Integr Manuf 22:493\u2013504","journal-title":"Robot Comput-Integr Manuf"},{"key":"986_CR2","volume-title":"The PDMA handbook of new product development","author":"MD Rosenau","year":"1996","unstructured":"Rosenau MD (1996) The PDMA handbook of new product development. Wiley, New York"},{"key":"986_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6383-9","volume-title":"Integrated product, process and enterprise design","author":"B Wang","year":"1997","unstructured":"Wang B (1997) Integrated product, process and enterprise design. Chapman & Hall, London"},{"key":"986_CR4","first-page":"351","volume":"15","author":"HZ Jia","year":"2003","unstructured":"Jia HZ, Fuh JYH, Nee AYC, Zhang YF (2003) A\u00a0modified genetic algorithm for distributed scheduling problems. J\u00a0Intell Manuf 15:351\u2013362","journal-title":"J\u00a0Intell Manuf"},{"key":"986_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"LD Giovanni","year":"2010","unstructured":"Giovanni LD, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200:395\u2013408","journal-title":"Eur J Oper Res"},{"key":"986_CR6","volume-title":"Process planning and scheduling for distributed manufacturing","year":"2007","unstructured":"Wang L, Shen W (eds) (2007) Process planning and scheduling for distributed manufacturing. Springer, London"},{"key":"986_CR7","volume-title":"Introduction to sequencing and scheduling","author":"K Baker","year":"1974","unstructured":"Baker K (1974) Introduction to sequencing and scheduling. Wiley, NewYork"},{"key":"986_CR8","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice-Hall, Englewood Cliffs"},{"issue":"2","key":"986_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job-shop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"key":"986_CR10","doi-asserted-by":"crossref","unstructured":"Wang S-Y, Wang L, Liu M, Xu Y (2013) An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int J Prod Econ (in press)","DOI":"10.1016\/j.ijpe.2013.05.004"},{"issue":"3","key":"986_CR11","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao J, Chen R, Deng W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641\u2013651","journal-title":"Int J Prod Res"},{"issue":"1","key":"986_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1177\/1063293X02010001054","volume":"10","author":"HZ Jia","year":"2002","unstructured":"Jia HZ, Fuh JYH, Nee AYC, Zheng YF (2002) Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurr Eng Res Appl 10(1):27\u201339","journal-title":"Concurr Eng Res Appl"},{"key":"986_CR13","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.eswa.2005.04.009","volume":"29","author":"FTS Chan","year":"2005","unstructured":"Chan FTS, Chung SH, Chan PLY (2005) An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Syst Appl 29:364\u2013371","journal-title":"Expert Syst Appl"},{"issue":"3","key":"986_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1080\/00207540500319229","volume":"44","author":"FTS Chan","year":"2006","unstructured":"Chan FTS, Chung SH, Chan PLY (2006) Application of genetic algorithms with dominated genes in a distributed scheduling problem in flexible manufacturing. Int J Prod Res 44(3):523\u2013543","journal-title":"Int J Prod Res"},{"key":"986_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"4","author":"M Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico M, Trubian M (1993) Applying tabu-search to the job-shop scheduling problem. Ann Oper Res 4:231\u2013252","journal-title":"Ann Oper Res"},{"key":"986_CR16","unstructured":"Matsuo H, Suh C, Sullivan R (1988) A\u00a0controlled search simulated annealing method for the general job-shop scheduling problem. Tech rep 03-04-88, Department of Management, The University of Texas, Austin"},{"key":"986_CR17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P Laarhoven Van","year":"1992","unstructured":"Van Laarhoven P, Aarts E, Lenstra J (1992) Job shop scheduling by simulated annealing. Oper Res 40:113\u2013125","journal-title":"Oper Res"},{"key":"986_CR18","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2000","unstructured":"Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York","edition":"5"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0986-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-0986-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0986-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:24:10Z","timestamp":1559370250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-0986-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,18]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["986"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-0986-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,18]]}}}