{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:28:07Z","timestamp":1779924487362,"version":"3.53.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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,12]]},"DOI":"10.1016\/s0305-0548(02)00124-7","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T19:12:46Z","timestamp":1054581166000},"page":"2081-2095","source":"Crossref","is-referenced-by-count":27,"title":["An efficient tabu search approach for the two-machine preemptive open shop scheduling problem"],"prefix":"10.1016","volume":"30","author":[{"given":"Ching-Fang","family":"Liaw","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00124-7_BIB1","series-title":"Scheduling algorithms","author":"Brucker","year":"1995"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB2","series-title":"Scheduling: theory, algorithms, and systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1137\/0211058","article-title":"Scheduling the open shop to minimize mean flow time","volume":"11","author":"Achugbue","year":"1982","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02243845","article-title":"Constructive heuristic algorithms for the open shop problem","volume":"51","author":"Brasel","year":"1993","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","article-title":"A branch and bound algorithm for the open-shop problem","volume":"76","author":"Brucker","year":"1997","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/S0305-0548(02)00124-7_BIB8","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(97)00332-9","article-title":"Classical and new heuristics for the open-shop problem","volume":"107","author":"Gueret","year":"1998","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0305-0548(02)00124-7_BIB9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","article-title":"A hybrid genetic algorithm for the open shop scheduling problem","volume":"124","author":"Liaw","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0305-0548(02)00124-7_BIB10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB11","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1979.1675246","article-title":"A note on open shop preemptive schedules","volume":"C-28","author":"Gonzalez","year":"1979","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB12","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1287\/opre.29.3.511","article-title":"Preemptive scheduling of independent jobs with release and due times on open, flow and job shops","volume":"29","author":"Cho","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/moor.6.1.153","article-title":"Minimizing maximum lateness in a two-machine open shop","volume":"6","author":"Lawler","year":"1981","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6377(85)90035-5","article-title":"On the complexity of preemptive open shop scheduling problem","volume":"4","author":"Liu","year":"1985","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/S0305-0548(02)00124-7_BIB15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0305-0548(87)90029-3","article-title":"Scheduling ordered open shops","volume":"14","author":"Liu","year":"1987","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(02)00124-7_BIB16","first-page":"25","article-title":"A branch-and-bound algorithm for the preemptive open shop scheduling problem","volume":"12","author":"Liu","year":"1995","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB17","doi-asserted-by":"crossref","unstructured":"Liaw CF. Scheduling preemptive open shops to minimize total tardiness. European Journal of Operational Research, 2001, in review.","DOI":"10.1080\/10170660109509466"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB18","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(94)90406-5","article-title":"On the complexity of preemptive openshop scheduling problems","volume":"77","author":"Sriskandarajah","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","article-title":"A dynamic priority rule for scheduling against due-dates","volume":"3","author":"Baker","year":"1982","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB20","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and linkage to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB22","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB23","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB24","unstructured":"Rayward-Smith VJ, Osman IH, Reeves CR, Smith GD, editors. Modern heuristic search methods. Chichester: Wiley, 1996."},{"key":"10.1016\/S0305-0548(02)00124-7_BIB25","unstructured":"Reeves CR, editor. Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific Publications, 1993."},{"key":"10.1016\/S0305-0548(02)00124-7_BIB26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","article-title":"Massively parallel tabu search for quadratic assignment problem","volume":"41","author":"Chakrapani","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job-shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB28","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"issue":"3","key":"10.1016\/S0305-0548(02)00124-7_BIB29","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1111\/j.1475-3995.1998.tb00117.x","article-title":"Fine-tuning a tabu search algorithm with statistical tests","volume":"5","author":"Xu","year":"1998","journal-title":"International Transactions on Operational Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.26.1.53","article-title":"A general bounding scheme for the permutation flow-shop problem","volume":"26","author":"Lageweg","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00124-7_BIB31","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Mathematical Programming"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001247?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001247?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T15:48:58Z","timestamp":1584719338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":31,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0305054802001247"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00124-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}