{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T14:55:54Z","timestamp":1701096954816},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T00:00:00Z","timestamp":1244246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10845-009-0270-1","type":"journal-article","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T00:43:05Z","timestamp":1244248985000},"page":"179-190","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines"],"prefix":"10.1007","volume":"22","author":[{"given":"Johnny C.","family":"Ho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco J.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex J.","family":"Ruiz-Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzu-Liang","family":"(Bill) Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,6]]},"reference":[{"key":"270_CR1","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1002\/nav.3800200417","volume":"20","author":"K.R. Baker","year":"1973","unstructured":"Baker K.R., Merten A.C. (1973) Scheduling with parallel processors & linear delay costs. Naval Research Logistics Quarterly 20: 793\u2013804. doi: 10.1002\/nav.3800200417","journal-title":"Naval Research Logistics Quarterly"},{"key":"270_CR2","doi-asserted-by":"crossref","unstructured":"Berrichi, A., Amodeo, L., Yalaoui, F., Chatelet, E., & Mezghiche, M. (2008). Bi-objective optimization algorithms for joint production and maintenance scheduling: Application to the parallel machine problem. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-008-0113-5 .","DOI":"10.1007\/s10845-008-0113-5"},{"key":"270_CR3","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J. Bruno","year":"1974","unstructured":"Bruno J., Coffman E.G., Sethi R. (1974) Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17: 382\u2013387. doi: 10.1145\/361011.361064","journal-title":"Communications of the ACM"},{"key":"270_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(93)90236-G","volume":"70","author":"C. Chen","year":"1993","unstructured":"Chen C., Bulfin R.L. (1993) Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research 70: 115\u2013125. doi: 10.1016\/0377-2217(93)90236-G","journal-title":"European Journal of Operational Research"},{"key":"270_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman","year":"1978","unstructured":"Coffman E.G., Garey M.R., Johnson D.S. (1978) An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing 7: 1\u201317. doi: 10.1137\/0207001","journal-title":"SIAM Journal on Computing"},{"key":"270_CR6","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/opre.41.4.797","volume":"41","author":"B.T. Eck","year":"1993","unstructured":"Eck B.T., Pinedo M. (1993) On the minimization of the makespan subject to flowtime optimality. Operations Research 41: 797\u2013800. doi: 10.1287\/opre.41.4.797","journal-title":"Operations Research"},{"key":"270_CR7","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.ijpe.2005.12.004","volume":"103","author":"P.K. Ganesan","year":"2006","unstructured":"Ganesan P.K., Sivakumar A.I. (2006) Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times. International Journal of Production Economics 103: 633\u2013647. doi: 10.1016\/j.ijpe.2005.12.004","journal-title":"International Journal of Production Economics"},{"key":"270_CR8","volume-title":"Computers & intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S. (1979) Computers & intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"270_CR9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1968","unstructured":"Graham R.L. (1968) Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17: 416\u2013429. doi: 10.1137\/0117039","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"270_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1590\/S0101-74382000000100003","volume":"20","author":"J.N.D. Gupta","year":"2000","unstructured":"Gupta J.N.D., Ho J.C. (2000) Minimizing flowtime subject to optimal makespan on two identical parallel machines. Pesquisa Operacional 20: 5\u201317. doi: 10.1590\/S0101-74382000000100003","journal-title":"Pesquisa Operacional"},{"key":"270_CR11","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/S0305-0548(99)00083-0","volume":"28","author":"J.N.D. Gupta","year":"2001","unstructured":"Gupta J.N.D., Ho J.C. (2001) Minimizing makespan subject to minimum flowtime on two identical parallel machines. Computers & Operations Research 28: 705\u2013717. doi: 10.1016\/S0305-0548(99)00083-0","journal-title":"Computers & Operations Research"},{"key":"270_CR12","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1080\/10170660409509403","volume":"21","author":"J.N.D. Gupta","year":"2004","unstructured":"Gupta J.N.D., Ho J.C., Ruiz-Torres A.J. (2004) Makespan minimization on identical parallel machines subject to minimum total flowtime. Journal of Chinese Institute of Industrial Engineers 21: 220\u2013229","journal-title":"Journal of Chinese Institute of Industrial Engineers"},{"key":"270_CR13","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1057\/palgrave.jors.2601016","volume":"51","author":"J.N.D. Gupta","year":"2000","unstructured":"Gupta J.N.D., Ho J.C., Webster S. (2000) Bicriteria optimization of makespan and mean flowtime on two identical parallel machines. The Journal of the Operational Research Society 51: 1330\u20131339","journal-title":"The Journal of the Operational Research Society"},{"key":"270_CR14","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/S0377-2217(99)00386-0","volume":"125","author":"J.N.D. Gupta","year":"2000","unstructured":"Gupta J.N.D., Ruiz-Torres A.J. (2000) Minimizing makespan subject to minimum total flow-time on identical parallel machines. European Journal of Operational Research 125: 370\u2013380. doi: 10.1016\/S0377-2217(99)00386-0","journal-title":"European Journal of Operational Research"},{"key":"270_CR15","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1002\/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D","volume":"42","author":"J.C. Ho","year":"1995","unstructured":"Ho J.C., Wong J.S. (1995) Makespan minimization for parallel identical processors. Naval Research Logistics 42: 935\u2013948. doi: 10.1002\/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D","journal-title":"Naval Research Logistics"},{"key":"270_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2006.07.023","volume":"182","author":"J.D. Laub","year":"2007","unstructured":"Laub J.D., Fowler J.W., Keha A.B. (2007) Minimizing makespan with multiple-orders-per-job in a two-machine flowshop. European Journal of Operational Research 182: 63\u201379. doi: 10.1016\/j.ejor.2006.07.023","journal-title":"European Journal of Operational Research"},{"key":"270_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0278-6125(88)90030-1","volume":"7","author":"C.Y. Lee","year":"1988","unstructured":"Lee C.Y., Massey J.D. (1988) Multiprocessor scheduling: An extension of the multifit algorithm. Journal of Manufacturing Systems 7: 25\u201332. doi: 10.1016\/0278-6125(88)90030-1","journal-title":"Journal of Manufacturing Systems"},{"key":"270_CR18","volume-title":"Complexity in numerical optimization","author":"C.Y. Lee","year":"1993","unstructured":"Lee C.Y., Vairaktarakis G.L. (1993) Complexity of single machine hierarchical scheduling: A survey. In: Pardalos P.M. (eds) Complexity in numerical optimization. World Scientific Publishing Company, New Jersey"},{"key":"270_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ijpe.2003.07.003","volume":"91","author":"B.M.T. Lin","year":"2004","unstructured":"Lin B.M.T., Jeng A.A.K. (2004) Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics 91: 121\u2013134. doi: 10.1016\/j.ijpe.2003.07.003","journal-title":"International Journal of Production Economics"},{"key":"270_CR20","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J.M. Moore","year":"1968","unstructured":"Moore J.M. (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15: 102\u2013109. doi: 10.1287\/mnsc.15.1.102","journal-title":"Management Science"},{"key":"270_CR21","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","volume":"81","author":"A. Nagar","year":"1995","unstructured":"Nagar A., Haddock J., Heragu S. (1995) Multiple & bicriteria scheduling: A literature survey. European Journal of Operational Research 81: 88\u2013104. doi: 10.1016\/0377-2217(93)E0140-S","journal-title":"European Journal of Operational Research"},{"key":"270_CR22","volume-title":"Operations scheduling with applications in manufacturing & services","author":"M. Pinedo","year":"1999","unstructured":"Pinedo M., Chao X. (1999) Operations scheduling with applications in manufacturing & services. McGraw-Hill, New York"},{"key":"270_CR23","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ijpe.2005.11.010","volume":"103","author":"A.J. Ruiz-Torres","year":"2006","unstructured":"Ruiz-Torres A.J., Ho J.C., Lopez F. (2006) Generating Pareto schedules with outsource and internal parallel resources. International Journal of Production Economics 103: 810\u2013825. doi: 10.1016\/j.ijpe.2005.11.010","journal-title":"International Journal of Production Economics"},{"key":"270_CR24","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/00207548808947934","volume":"26","author":"S.C. Sarin","year":"1988","unstructured":"Sarin S.C., Ahn S., Bishop A.B. (1988) An improved branching scheme for the branch & bound procedure of scheduling n jobs on m machines to minimize total weighted flow time. International Journal of Production Research 26: 1183\u20131191. doi: 10.1080\/00207548808947934","journal-title":"International Journal of Production Research"},{"key":"270_CR25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith W.E. (1956) Various optimizers for single-state production. Naval Research Logistics Quarterly 3: 59\u201366. doi: 10.1002\/nav.3800030106","journal-title":"Naval Research Logistics Quarterly"},{"key":"270_CR26","volume-title":"Industrial scheduling","author":"D.R. Sule","year":"1997","unstructured":"Sule D.R. (1997) Industrial scheduling. PWS Publishing, Boston"},{"key":"270_CR27","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10845-006-0032-2","volume":"17","author":"L. Tang","year":"2006","unstructured":"Tang L., Luo J. (2006) A new ILS algorithm for parallel machine scheduling problems. Journal of Intelligent Manufacturing 17: 609\u2013619. doi: 10.1007\/s10845-006-0032-2","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0270-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-009-0270-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0270-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:11:45Z","timestamp":1559268705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-009-0270-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s10845-009-0270-1","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,6]]}}}