{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:14:05Z","timestamp":1772781245039,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":[[1993,10]]},"DOI":"10.1016\/0305-0548(93)90102-o","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"807-816","source":"Crossref","is-referenced-by-count":37,"title":["Determining the optimal starting times in a cyclic schedule with a given route"],"prefix":"10.1016","volume":"20","author":[{"given":"Lei","family":"Lei","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)90102-O_BIB1","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/opre.38.4.629","article-title":"Fixed cycle scheduling: a solvable problem with empty precedence structure","volume":"38","author":"Garfinkel","year":"1990","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(93)90102-O_BIB2","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":"Mgmt Sci."},{"key":"10.1016\/0305-0548(93)90102-O_BIB3","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0402049","article-title":"A mathematical model for periodic scheduling problems","volume":"2","author":"Serafin","year":"1989","journal-title":"SIAM J. Disc. Math."},{"key":"10.1016\/0305-0548(93)90102-O_BIB4","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 with time-window constraints","volume":"37","author":"Lei","year":"1991","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(93)90102-O_BIB5","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 Trans."},{"key":"10.1016\/0305-0548(93)90102-O_BIB6","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problem with time-window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(93)90102-O_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/01966324.1986.10737196","article-title":"Vehicle routing with time-window constraints","volume":"6","author":"Golden","year":"1986","journal-title":"Am. J. Math. Mgmt Sci."},{"key":"10.1016\/0305-0548(93)90102-O_BIB8","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":"Desrosiers","year":"1988","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(93)90102-O_BIB9","article-title":"A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints","author":"Armstrong","year":"1993","journal-title":"Europ. Op. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390102O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390102O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:25:45Z","timestamp":1552929945000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489390102O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["030505489390102O"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)90102-o","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}