{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T01:08:33Z","timestamp":1781831313776,"version":"3.54.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T00:00:00Z","timestamp":1637107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00500-021-06481-y","type":"journal-article","created":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T19:02:43Z","timestamp":1637175763000},"page":"3527-3543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Flexible job shop scheduling problem considering machine and order acceptance, transportation costs, and setup times"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1019-7081","authenticated-orcid":false,"given":"Mohsen","family":"Ziaee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javad","family":"Mortazavi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohsen","family":"Amra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,17]]},"reference":[{"key":"6481_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cor.2016.11.017","volume":"84","author":"A Ahmadi-Javid","year":"2017","unstructured":"Ahmadi-Javid A, Hooshangi-Tabrizi P (2017) Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: A mathematical formulation and an Anarchic Society Optimization algorithm. Computers Oper Res 84:73\u201391","journal-title":"Computers Oper Res"},{"issue":"1","key":"6481_CR2","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/TASE.2013.2247757","volume":"11","author":"B Alidaee","year":"2014","unstructured":"Alidaee B, Li H (2014) Parallel machine selection and job scheduling to minimize sum of machine holding cost, total machine time costs, and total tardiness costs. IEEE Transactions Automation Sci Eng 11(1):294\u2013301","journal-title":"IEEE Transactions Automation Sci Eng"},{"issue":"1","key":"6481_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jmsy.2011.02.004","volume":"30","author":"A Bagheri","year":"2011","unstructured":"Bagheri A, Zandieh M (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times\u2014variable neighborhood search approach. J Manuf Syst 30(1):8\u201315","journal-title":"J Manuf Syst"},{"issue":"4","key":"6481_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Computer Syst 26(4):533\u2013541","journal-title":"Future Gener Computer Syst"},{"issue":"1","key":"6481_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13(1):64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"6481_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157\u2013183","journal-title":"Ann Oper Res"},{"issue":"4","key":"6481_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369\u2013375","journal-title":"Computing"},{"issue":"8","key":"6481_CR8","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1016\/j.cor.2004.01.001","volume":"32","author":"D Cao","year":"2005","unstructured":"Cao D, Chen M, Wan G (2005) Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Computers Oper Res 32(8):1995\u20132012","journal-title":"Computers Oper Res"},{"key":"6481_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281\u2013306","journal-title":"Ann Oper Res"},{"issue":"3","key":"6481_CR10","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir Y, \u0130\u015fleyen SK (2013) Evaluation of mathematical models for flexible job-shop scheduling problems. Appl Math Model 37(3):977\u2013988","journal-title":"Appl Math Model"},{"issue":"1","key":"6481_CR100","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L Fanjul-Peyro","year":"2010","unstructured":"Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55\u201369","journal-title":"Eur J Oper Res"},{"issue":"7","key":"6481_CR11","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1016\/j.cor.2011.10.012","volume":"39","author":"L Fanjul-Peyro","year":"2012","unstructured":"Fanjul-Peyro L, Ruiz R (2012) Scheduling unrelated parallel machines with optional machines and jobs selection. Computers Oper Res 39(7):1745\u20131753","journal-title":"Computers Oper Res"},{"issue":"3","key":"6481_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331","journal-title":"J Intell Manuf"},{"issue":"3","key":"6481_CR13","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ejor.2006.11.050","volume":"199","author":"G Finke","year":"2009","unstructured":"Finke G, Lemaire P, Proth J, Queyranne M (2009) Minimizing the number of machines for minimum length schedules. Eur J Oper Res 199(3):702\u2013705","journal-title":"Eur J Oper Res"},{"issue":"2","key":"6481_CR14","doi-asserted-by":"publisher","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 flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"key":"6481_CR15","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.apm.2016.09.022","volume":"41","author":"S Karimi","year":"2017","unstructured":"Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Appl Math Model 41:667\u2013682","journal-title":"Appl Math Model"},{"issue":"2","key":"6481_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2008.10.008","volume":"199","author":"SA Kravchenko","year":"2009","unstructured":"Kravchenko SA, Werner F (2009) Minimizing the number of machines for scheduling jobs with equal processing times. Eur J Oper Res 199(2):595\u2013600","journal-title":"Eur J Oper Res"},{"issue":"1","key":"6481_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0377-2217(02)00675-6","volume":"152","author":"Y Mati","year":"2004","unstructured":"Mati Y, Xie X (2004) The complexity of two-job shop problems with multi-purpose unrelated machines. Eur J Oper Res 152(1):159\u2013169","journal-title":"Eur J Oper Res"},{"issue":"6","key":"6481_CR18","doi-asserted-by":"publisher","first-page":"9625","DOI":"10.1016\/j.eswa.2008.09.063","volume":"36","author":"B Naderi","year":"2009","unstructured":"Naderi B, Zandieh M, Balagh AKG, Roshanaei V (2009) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36(6):9625\u20139633","journal-title":"Expert Syst Appl"},{"issue":"5\u20138","key":"6481_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s00170-009-2122-8","volume":"46","author":"B Naderi","year":"2010","unstructured":"Naderi B, Javid AA, Jolai F (2010) Permutation flowshops with transportation times: mathematical models and solution methods. Int J Adv Manuf Technol 46(5\u20138):631\u2013647","journal-title":"Int J Adv Manuf Technol"},{"key":"6481_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jmsy.2017.11.001","volume":"46","author":"A Noroozi","year":"2018","unstructured":"Noroozi A, Mazdeh MM, Heydari M, Rasti-Barzoki M (2018) Coordinating order acceptance and integrated production-distribution scheduling with batch delivery considering third Party Logistics distribution. J Manuf Syst 46:29\u201345","journal-title":"J Manuf Syst"},{"issue":"1","key":"6481_CR21","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ijpe.2010.02.002","volume":"125","author":"C Oguz","year":"2010","unstructured":"Oguz C, Salman FS, Yal\u00e7\u0131n ZB (2010) Order acceptance and scheduling decisions in make-to-order systems. Int J Prod Econ 125(1):200\u2013211","journal-title":"Int J Prod Econ"},{"issue":"2","key":"6481_CR22","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.ejor.2015.06.018","volume":"247","author":"HF Rahman","year":"2015","unstructured":"Rahman HF, Sarker R, Essam D (2015) A real-time order acceptance and scheduling approach for permutation flow shop problems. Eur J Oper Res 247(2):488\u2013503","journal-title":"Eur J Oper Res"},{"issue":"6","key":"6481_CR23","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"Roshanaei V, Naderi B, Jolai F, Khalili M (2009) A variable neighborhood search for job shop scheduling with setup times to minimize makespan. Future Gener Computer Syst 25(6):654\u2013661","journal-title":"Future Gener Computer Syst"},{"issue":"20","key":"6481_CR24","doi-asserted-by":"publisher","first-page":"6247","DOI":"10.1080\/00207543.2013.827806","volume":"51","author":"V Roshanaei","year":"2013","unstructured":"Roshanaei V, Azab A, ElMaraghy H (2013) Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int J Prod Res 51(20):6247\u20136274","journal-title":"Int J Prod Res"},{"issue":"2","key":"6481_CR25","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.ijpe.2005.11.010","volume":"103","author":"AJ Ruiz-Torres","year":"2006","unstructured":"Ruiz-Torres AJ, Ho JC, L\u00f3pez FJ (2006) Generating Pareto schedules with outsource and internal parallel resources. Int J Prod Econ 103(2):810\u2013825","journal-title":"Int J Prod Econ"},{"issue":"5","key":"6481_CR26","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1057\/jors.2009.38","volume":"61","author":"AJ Ruiz-Torres","year":"2010","unstructured":"Ruiz-Torres AJ, L\u00f3pez FJ, Wojciechowski P, Ho JC (2010) Parallel machine scheduling problems considering regular measures of performance and machine cost. J Oper Res Soc 61(5):849\u2013857","journal-title":"J Oper Res Soc"},{"issue":"5","key":"6481_CR27","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32(5):563\u2013570","journal-title":"Int J Adv Manuf Technol"},{"issue":"2\u20133","key":"6481_CR28","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0166-218X(99)00115-8","volume":"93","author":"VA Strusevich","year":"1999","unstructured":"Strusevich VA (1999) A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Appl Math 93(2\u20133):287\u2013304","journal-title":"Discrete Appl Math"},{"issue":"2","key":"6481_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"HM Wagner","year":"1959","unstructured":"Wagner HM (1959) An integer linear-programming model for machine scheduling. Naval Res Logist Q 6(2):131\u2013140","journal-title":"Naval Res Logist Q"},{"issue":"4","key":"6481_CR30","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G Zhang","year":"2009","unstructured":"Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers Indus Eng 56(4):1309\u20131318","journal-title":"Computers Indus Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06481-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06481-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06481-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T12:09:49Z","timestamp":1647259789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06481-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,17]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["6481"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06481-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,17]]},"assertion":[{"value":"21 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Nothing to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"A Fusion of Foundations, Methodologies, and Applications. I testify on behalf of all co-authors that our article submitted to Soft Computing A Fusion of Foundations, Methodologies, and Applications:","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}