{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T19:29:35Z","timestamp":1771874975142,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0167-6377(93)90101-l","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"91-98","source":"Crossref","is-referenced-by-count":35,"title":["Minimizing the fleet size with dependent time-window and single-track constraints"],"prefix":"10.1016","volume":"14","author":[{"given":"Lei","family":"Lei","sequence":"first","affiliation":[]},{"given":"Ronald","family":"Armstrong","sequence":"additional","affiliation":[]},{"given":"Shanhong","family":"Gu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(93)90101-L_BIB1","doi-asserted-by":"crossref","unstructured":"R. Armstrong, L. Lei, and S. Gu, \u201cA bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints\u201d, Europ. J. Oper. Res. (to appear).","DOI":"10.1016\/0377-2217(94)90127-9"},{"issue":"2","key":"10.1016\/0167-6377(93)90101-L_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews-the-state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers Oper. Res."},{"issue":"8","key":"10.1016\/0167-6377(93)90101-L_BIB3","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1287\/mnsc.34.8.1005","article-title":"Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows","volume":"34","author":"Desrosier","year":"1988","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(93)90101-L_BIB4","unstructured":"L. Lei, \u201cAn O(N2\u00b7log(N)\u00b7log(B)) algorithm for determining the optimal integer cyclic transportation schedules with a given route and dependent time windows\u201d, Computers Oper. Res. (to appear)."},{"issue":"12","key":"10.1016\/0167-6377(93)90101-L_BIB5","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1287\/mnsc.37.12.1629","article-title":"The minimum common-cycle algorithm for cyclic scheduling of two hoists of two hoists with time window constraints","volume":"37","author":"Lei","year":"1991","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(93)90101-L_BIB6","unstructured":"L. Lei and T.J. Wang, \u201cOn the optimal cyclic schedules of single hoist electroplating processes\u201d, IIE Transactions (to appear)."},{"issue":"5","key":"10.1016\/0167-6377(93)90101-L_BIB7","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.37.5.587","article-title":"A crane scheduling problem in a computer-integrated manufacturing environment","volume":"37","author":"Matsuo","year":"1991","journal-title":"Management Sci."},{"issue":"2","key":"10.1016\/0167-6377(93)90101-L_BIB8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/05695557608975070","article-title":"Mathematical programming solution of a hoist scheduling problem","volume":"8","author":"Phillips","year":"1976","journal-title":"AIIE Transactions"},{"issue":"2","key":"10.1016\/0167-6377(93)90101-L_BIB9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/07408178808966165","article-title":"Hoist scheduling for a PCB electroplating facility","volume":"20","author":"Shapiro","year":"1988","journal-title":"IIE Transactions"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390101L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390101L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:00Z","timestamp":1552902720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390101L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["016763779390101L"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90101-l","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}