{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:53:25Z","timestamp":1770969205679,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0305-0548(01)00098-3","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"309-320","source":"Crossref","is-referenced-by-count":98,"title":["A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem"],"prefix":"10.1016","volume":"30","author":[{"given":"Ali","family":"Tozkapan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6mer","family":"K\u0131rca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Shin","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(01)00098-3_BIB1","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","article-title":"The two-stage assembly scheduling problem: complexity and approximation","volume":"43","author":"Potts","year":"1995","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/S0305-0548(01)00098-3_BIB2","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","article-title":"Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem","volume":"39","author":"Lee","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(01)00098-3_BIB3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","article-title":"A branch and bound algorithm for the two-stage assembly scheduling problem","volume":"103","author":"Hariri","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(01)00098-3_BIB4","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0305-0548(00)00004-6","article-title":"The three stage assembly flowshop scheduling problem","volume":"28","author":"Koulamas","year":"2001","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(01)00098-3_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0305-0548(99)00010-6","article-title":"Minimizing mean flowtime in a two machine flowshop with sequence independent setup times","volume":"27","author":"Allahverdi","year":"2000","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(01)00098-3_BIB6","unstructured":"Chung C, K\u0131rca O. A branch and bound algorithm to minimize the total weighted flowtime for m-machine flowshop problems. Middle East Technical University Industrial Engineering Department Technical Report, 1996."},{"key":"10.1016\/S0305-0548(01)00098-3_BIB7","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1080\/05695557708975160","article-title":"Minimizing the sum of completion times of n jobs over m machines in a flowshop\u2014a branch and bound approach","volume":"9","author":"Bansal","year":"1977","journal-title":"AIIE Transactions"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000983?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000983?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:23:56Z","timestamp":1556889836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0305054801000983"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00098-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}