{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T14:07:15Z","timestamp":1775570835642,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1016002910561","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T01:59:24Z","timestamp":1041127164000},"page":"111-122","source":"Crossref","is-referenced-by-count":14,"title":["An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT"],"prefix":"10.1007","volume":"108","author":[{"given":"Kim-Lin","family":"Chew","sequence":"first","affiliation":[]},{"given":"Johnny","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Qizhang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jihong","family":"Ou","sequence":"additional","affiliation":[]},{"given":"Chung-Piaw","family":"Teo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5087900_CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/S0305-0548(98)00019-7","volume":"25","author":"J.E. Beasley","year":"1998","unstructured":"J.E. Beasley and B. Cao, Dynamic programming based algorithm for crew scheduling, Computers and Operations Research 25 (1998) 567\u2013582.","journal-title":"Computers and Operations Research"},{"key":"5087900_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L. Bodin","year":"1983","unstructured":"L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews; the state of the art, Computers and Operations Research 10 (1983) 63\u2013211.","journal-title":"Computers and Operations Research"},{"key":"5087900_CR3","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"A. Caprara, M. Fischetti and P. Toth, A heuristic method for the set covering problem, Operations Research 47 (1999) 730\u2013743.","journal-title":"Operations Research"},{"key":"5087900_CR4","unstructured":"L. Cavique, C. Rego and I. Themido, Subgraph ejection chains and tabu search for the crew scheduling problem (1997) submitted."},{"key":"5087900_CR5","unstructured":"Committee on the Next Decade of Operations Research (CONDOR 1998), Operations research: The next decade, Operations Research 36."},{"key":"5087900_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02288324","volume":"13","author":"U. Derigs","year":"1988","unstructured":"U. Derigs, Solving non-bipartite matching problems vis. shortest path techniques, Annals of Operations Research 13 (1988) 225\u2013261.","journal-title":"Annals of Operations Research"},{"key":"5087900_CR7","volume-title":"Computer-Aided Transit Scheduling","author":"M. Desrochers","year":"1990","unstructured":"M. Desrochers and J.-M. Rousseau, Computer-Aided Transit Scheduling (Springer, Berlin, 1990)."},{"key":"5087900_CR8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"F. Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences 8 (1977) 156\u2013166.","journal-title":"Decision Sciences"},{"key":"5087900_CR9","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna, Tabu Search (Kluwer Academic, 1997).","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"5087900_CR10","volume-title":"Computer Scheduling of Public Transport 2","author":"J.-M. Rousseau","year":"1985","unstructured":"J.-M. Rousseau, Computer Scheduling of Public Transport 2 (North-Holland, Amsterdam, 1985)."},{"key":"5087900_CR11","volume-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","author":"A. Wren","year":"1981","unstructured":"A. Wren, Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling (North-Holland, Amsterdam, 1981)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016002910561.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016002910561\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016002910561.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:11:44Z","timestamp":1747577504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016002910561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":11,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["5087900"],"URL":"https:\/\/doi.org\/10.1023\/a:1016002910561","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}