{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T16:45:18Z","timestamp":1771865118053,"version":"3.50.1"},"publisher-location":"New Delhi","reference-count":29,"publisher":"Springer India","isbn-type":[{"value":"9788132217671","type":"print"},{"value":"9788132217688","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1768-8_38","type":"book-chapter","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:11:09Z","timestamp":1393891869000},"page":"423-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Heuristic for Permutation Flowshop Scheduling to Minimize Makespan"],"prefix":"10.1007","author":[{"given":"Deepak","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Kewal Krishan","family":"Nailwal","sequence":"additional","affiliation":[]},{"given":"Sameer","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"key":"38_CR1","volume-title":"Introduction to Sequencing and Scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1057\/jors.1976.93","volume":"27","author":"PF Bestwick","year":"1976","unstructured":"Bestwick, P.F., Hastings, N.A.J.: A new bound for machine scheduling. Oper. Res. Q. 27, 479\u2013487 (1976)","journal-title":"Oper. Res. Q."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1057\/jors.1976.176","volume":"27","author":"MC Bonney","year":"1976","unstructured":"Bonney, M.C., Gundry, S.W.: Solutions to the constrained flowshop sequencing problem. Oper. Res. Q. 27, 869\u2013883 (1976)","journal-title":"Oper. Res. Q."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for n-jobs, m-machine sequencing problem. Manage. Sci. 16, 630\u2013637 (1970)","journal-title":"Manage. Sci."},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1504\/IJICT.2007.013279","volume":"1","author":"UK Chakraborty","year":"2007","unstructured":"Chakraborty, U.K., Laha, D.: An improved heuristic for permutation flowshop scheduling. Int. J. Inf. Commun. Technol. 1, 89\u201397 (2007)","journal-title":"Int. J. Inf. Commun. Technol."},{"key":"38_CR6","volume-title":"Theory of Scheduling","author":"RW Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","volume":"23","author":"DG Dannenbring","year":"1977","unstructured":"Dannenbring, D.G.: An evaluation of flowshop sequencing heuristics. Manage. Sci. 23, 1174\u20131182 (1977)","journal-title":"Manage. Sci."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"JM Framinan","year":"2004","unstructured":"Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55, 1243\u20131255 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MRD Garey","year":"1976","unstructured":"Garey, M.R.D., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Math. Oper. Res. 1, 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31, 1891\u20131909 (2004)","journal-title":"Comput. Oper. Res."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimisation and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1057\/jors.1971.18","volume":"22","author":"JND Gupta","year":"1971","unstructured":"Gupta, J.N.D.: A functional heuristic for the flow-shop scheduling problem. Oper. Res. Q. 22, 39\u201347 (1971)","journal-title":"Oper. Res. Q."},{"key":"38_CR13","first-page":"63","volume":"10","author":"JND Gupta","year":"1976","unstructured":"Gupta, J.N.D.: A heuristic algorithm for the flow shop scheduling problem. R.A.I.R.O. Rech. Operationnelle 10, 63\u201373 (1976)","journal-title":"R.A.I.R.O. Rech. Operationnelle"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E Ignall","year":"1965","unstructured":"Ignall, E., Scharge, L.: Application of the branch and bound technique to some flow shop scheduling problems. Oper. Res. 13, 400\u2013412 (1965)","journal-title":"Oper. Res."},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res Logistics Q. 1, 61\u201368 (1954)","journal-title":"Naval Res Logistics Q."},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.omega.2005.03.003","volume":"35","author":"PJ Kalczynski","year":"2007","unstructured":"Kalczynski, P.J., Kamburowski, J.: On NEH heuristic for minimizing the makespan in permutation flowshops. OMEGA, Int. J. Manage. Sci. 35, 53\u201360 (2007)","journal-title":"OMEGA, Int. J. Manage. Sci."},{"key":"38_CR17","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","volume":"35","author":"PJ Kalczynski","year":"2008","unstructured":"Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35, 3001\u20133008 (2008)","journal-title":"Comput. Oper. Res."},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1080\/00207548008919673","volume":"18","author":"JR King","year":"1980","unstructured":"King, J.R., Spachis, A.S.: Heuristics for flowshop scheduling. Int. J. Prod. Res. 18, 345\u2013357 (1980)","journal-title":"Int. J. Prod. Res."},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1057\/jors.1965.7","volume":"16","author":"ZA Lomnicki","year":"1965","unstructured":"Lomnicki, Z.A.: A branch and bound algorithm for the exact solution to some flow shop scheduling problems. Oper. Res. Q. 16, 89\u2013100 (1965)","journal-title":"Oper. Res. Q."},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E.E., Ham, L.: A heuristic algorithm for the m machine, n job flow shop sequencing problem. OMEGA, Int. J. Manage. Sci. 11, 91\u201395 (1983)","journal-title":"OMEGA, Int. J. Manage. Sci."},{"key":"38_CR21","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res. 91, 160\u2013175 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR22","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1111\/j.2517-6161.1961.tb00432.x","volume":"23","author":"ES Page","year":"1961","unstructured":"Page, E.S.: An approach to the scheduling of jobs on machines. J. Roy. Stat. Soc. 23, 484\u2013492 (1961)","journal-title":"J. Roy. Stat. Soc."},{"key":"38_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"DS Palmer","year":"1965","unstructured":"Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimum. Oper. Res. Q. 16, 101\u2013107 (1965)","journal-title":"Oper. Res. Q."},{"key":"38_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/00207548408942436","volume":"22","author":"YB Park","year":"1984","unstructured":"Park, Y.B., Pegden, C.D., Enscore, E.E.: A survey and evaluation of static flowshop scheduling heuristics. Int. J. Prod. Res. 22, 127\u2013141 (1984)","journal-title":"Int. J. Prod. Res."},{"key":"38_CR25","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Upper Saddle (2002)"},{"key":"38_CR26","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Eur. J. Oper. Res. 155, 426\u2013438 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22, 5\u201313 (1995)","journal-title":"Comput. Oper. Res."},{"key":"38_CR28","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flow shop heuristics. Eur. J. Oper. Res. 165, 479\u2013494 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR29","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1768-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T19:15:53Z","timestamp":1716578153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1768-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132217671","9788132217688"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1768-8_38","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"4 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}