{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:19:05Z","timestamp":1726082345920},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811532894"},{"type":"electronic","value":"9789811532900"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3290-0_14","type":"book-chapter","created":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T11:05:36Z","timestamp":1588158336000},"page":"171-183","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Flow Shop Scheduling Problem of\u00a0Minimizing Makespan with Bounded Processing Parameters"],"prefix":"10.1007","author":[{"given":"Meenakshi","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Manisha","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Sameer","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"14_CR1","unstructured":"S. Aggarwal, A. Gautam, D.K. Chauhan, L.M. Tiwari, S. Kapoor, A flow shop scheduling problem with transportation time and separated setup time of jobs. Procedia Eng. 38, 1327\u20131332 (2012)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"A. Allahverdi, The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246, 345\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"A. Allahverdi, Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Decis. Mak. Manuf. Serv. 1(1\u20132), 5\u201323 (2017)","DOI":"10.7494\/dmms.2007.1.2.5"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.ejor.2004.07.074","volume":"169","author":"A Allahverdi","year":"2006","unstructured":"A. Allahverdi, F. Al-Anzi, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times. Eur. J. Oper. Res. 169, 767\u2013780 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/1475-3995.00393","volume":"10","author":"A Allahverdi","year":"2003","unstructured":"A. Allahverdi, Y.N. Sotskov, Two machine flowshop minimum length scheduling problem with random and bounded processing times. Int. Trans. Oper. Res. 10, 65\u201376 (2003)","journal-title":"Int. Trans. Oper. Res."},{"key":"14_CR6","first-page":"47","volume":"2","author":"PC Bagga","year":"1986","unstructured":"P.C. Bagga, K. Khurana, Two-machine flowshop with separated sequence-independent setup times: mean completion time criterion. Indian J. Manag. Syst. 2, 47\u201357 (1986)","journal-title":"Indian J. Manag. Syst."},{"issue":"2","key":"14_CR7","first-page":"301","volume":"10","author":"AB Chandramauli","year":"2005","unstructured":"A.B. Chandramauli, Heuristic approach for n-job 3 machine flow shop scheduling problem involving transportation time, breakdown and weights of jobs. Math. Comput. Appl. 10(2), 301\u2013305 (2005)","journal-title":"Math. Comput. Appl."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"3962","DOI":"10.1016\/j.cor.2007.05.005","volume":"35","author":"X Dong","year":"2008","unstructured":"X. Dong, H. Huang, P. Chen, An improved NEH-based heuristic for permutation flow shop problem. Comput. Oper. Res. 35, 3962\u20133968 (2008)","journal-title":"Comput. Oper. Res."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/0360-8352(94)90337-9","volume":"27","author":"R Gangadharan","year":"1994","unstructured":"R. Gangadharan, C. Rajendran, A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Comput. Ind. Eng. 27, 473\u2013476 (1994)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1986","unstructured":"M.R. Garey, J.R. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1986)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"14_CR11","first-page":"30","volume":"1","author":"D Gupta","year":"2011","unstructured":"D. Gupta, S. Sharma, S. Sharma, Heuristic approach for n-jobs, 3-machines flow shop scheduling problem, processing time associated with probabilities involving transportation time, break-down interval, weightage of jobs and job block criteria. Math. Theory Model. 1(1), 30\u201336 (2011)","journal-title":"Math. Theory Model."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"S.M. Johnson, Optimal two and three stage production schedules with setup time included. Naval Res. Log. Q. 1, 69\u201381 (1954)","journal-title":"Naval Res. Log. Q."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","volume":"35","author":"PJ Kalczynski","year":"2009","unstructured":"P.J. Kalczynski, J. Kamburowski, An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35, 3001\u20133008 (2009)","journal-title":"Comput. Oper. Res."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","volume":"193","author":"W Liu","year":"2017","unstructured":"W. Liu, Y. Jin, M. Price, A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Product. Econ. 193, 21\u201330 (2017)","journal-title":"Int. J. Product. Econ."},{"key":"14_CR15","volume-title":"Elements of Advanced Production Scheduling","author":"PL Maggu","year":"1980","unstructured":"P.L. Maggu, G. Das, Elements of Advanced Production Scheduling (UPPD, New Delhi, 1980)"},{"issue":"1","key":"14_CR16","first-page":"77","volume":"3","author":"A Mittal","year":"2011","unstructured":"A. Mittal, S. Agarwal, S. Prasad, S.R. Ansari, Heuristic approach for n jobs, 3 machines flow shop scheduling problem involving transportation time, equivalent job block, weight of jobs and break down internval. Int. J. Appl. Math. Appl. 3(1), 77\u201384 (2011)","journal-title":"Int. J. Appl. Math. Appl."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"M. Nawaz, E.E. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega. 11(1), 91\u201395 (1983)","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"C. Rajendran, H. Ziegler, Ant colony algorithms for permutation flow shop scheduling to minimize makespan\/ total flowtime of jobs. Eur. j. op. Res. 155(2), 426\u2013438 (2004)","DOI":"10.1016\/S0377-2217(02)00908-6"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"R. Ruiz, T. Stutzle. An iterated greedy algorithm for permutation flow shop scheduling problem. Eur. J. Oper. Res. 177(3), 2033-2049 (2007)","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1057\/palgrave.jors.2601682","volume":"55","author":"YN Sotskov","year":"2004","unstructured":"Y.N. Sotskov, A. Allahverdi, T.C. Lai, Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc. 55, 277\u2013286 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1504\/IJMTM.2003.002528","volume":"21","author":"L Wang","year":"2003","unstructured":"L. Wang, D.Z. Zheng, An effective hybrid heuristic for flow shop scheduling. Int. J. Adv. Manuf. Tech. 21, 38\u201344 (2003)","journal-title":"Int. J. Adv. Manuf. Tech."},{"issue":"6","key":"14_CR22","first-page":"355","volume":"36","author":"KC Ying","year":"2014","unstructured":"K.C. Ying, S.-W. Lin, A high-performing constructive heuristic for minimizing makespan in permutation flowshops. Int. J. Product. Ind. Eng. 36(6), 355\u2013362 (2014)","journal-title":"Int. J. Product. Ind. Eng."}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing for Problem Solving 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3290-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T17:15:46Z","timestamp":1615482946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3290-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811532894","9789811532900"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3290-0_14","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}