{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:22:27Z","timestamp":1772749347191,"version":"3.50.1"},"reference-count":19,"publisher":"Informa UK Limited","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1080\/00207160701331376","type":"journal-article","created":{"date-parts":[[2007,11,22]],"date-time":"2007-11-22T10:04:35Z","timestamp":1195725875000},"page":"1731-1741","source":"Crossref","is-referenced-by-count":6,"title":["A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness"],"prefix":"10.1080","volume":"84","author":[{"given":"B.","family":"Shahul Hamid Khan","sequence":"first","affiliation":[{"name":"National Institute of Technology","place":["India"]}]},{"given":"G.","family":"Prabhaharan","sequence":"additional","affiliation":[{"name":"National Institute of Technology","place":["India"]}]},{"given":"P.","family":"Asokan","sequence":"additional","affiliation":[{"name":"National Institute of Technology","place":["India"]}]}],"member":"301","published-online":{"date-parts":[[2008,10]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0140-S"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(00)00039-6"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.13.3.400"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.16.10.B630"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1993.3"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00029-C"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H"},{"key":"e_1_3_2_11_1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/S0360-8352(97)00139-3","article-title":"Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flow line\u2013based manufacturing cell","volume":"34","author":"Srinivasaraghavan P.","year":"1998","unstructured":"Srinivasaraghavan , P. and Rajendran , C. 1998 . Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flow line\u2013based manufacturing cell . Computers and Industrial Engineering , 34 : 531 \u2013 46 .","journal-title":"Computers and Industrial Engineering"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/095372899232777"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00253-9"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_2_15_1","unstructured":"Binato S. Hery W. J. Loewenstern D. M. and Resende M. G.C. March 2000 . \u201c A GRASP for job shop scheduling Technical Report \u201d . March AT&T Labs Research ."},{"issue":"11","key":"e_1_3_2_16_1","first-page":"1126","article-title":"Implementation of GRASP in flowshop scheduling","volume":"30","author":"Prabhaharan G.","year":"2004","unstructured":"Prabhaharan , G. , Shahul Hamid Khan , B. and Rakesh , L. 2004 . Implementation of GRASP in flowshop scheduling . International Journal of Advanced Manufacturing Technology , 30 ( 11 ) : 1126 \u2013 1131 .","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"4","key":"e_1_3_2_17_1","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1009736921890","article-title":"A greedy randomized adaptive search procedure for the feedback vertex set problem","volume":"2","author":"Pardalos P. M.","year":"1999","unstructured":"Pardalos , P. M. , Qian , T. and Resende , M. G.C. 1999 . A greedy randomized adaptive search procedure for the feedback vertex set problem . Journal of Combinatorial Optimization , 2 ( 4 ) : 399 \u2013 412 .","journal-title":"Journal of Combinatorial Optimization"},{"key":"e_1_3_2_18_1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","article-title":"Semi-greedy heuristics: an empirical study","volume":"6","author":"Hart J. P.","year":"1987","unstructured":"Hart , J. P. and Shogan , A. W. 1987 . Semi-greedy heuristics: an empirical study . Operation Research Letters , 6 : 107 \u2013 114 .","journal-title":"Operation Research Letters"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.07.020"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160701331376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T21:30:50Z","timestamp":1772746250000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160701331376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":19,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1080\/00207160701331376"],"URL":"https:\/\/doi.org\/10.1080\/00207160701331376","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}