{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:17:40Z","timestamp":1770995860315,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0377-2217(03)00090-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"330-335","source":"Crossref","is-referenced-by-count":19,"title":["A note on the assignment problem with seniority and job priority constraints"],"prefix":"10.1016","volume":"154","author":[{"given":"A","family":"Volgenant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00090-0_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(03)00090-0_BIB2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1287\/opre.47.3.449","article-title":"The assignment problem with seniority and job priority constraints","volume":"47","author":"Caron","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00090-0_BIB3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest augmenting path algorithm for dense and sparse assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(03)00090-0_BIB4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.40.1.178","article-title":"A shortest augmenting path algorithm for the semi-assignment problem","volume":"40","author":"Kennington","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00090-0_BIB5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(94)90039-6","article-title":"Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem","volume":"55","author":"Punnen","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(03)00090-0_BIB6","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/S0377-2217(01)00214-4","article-title":"Solving some lexicographic multi-objective combinatorial problems","volume":"139","author":"Volgenant","year":"2002","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000900?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000900?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:24:06Z","timestamp":1553228646000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703000900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0377221703000900"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00090-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}