{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:30:15Z","timestamp":1772749815602,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1016\/s0377-2217(98)00092-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"188-198","source":"Crossref","is-referenced-by-count":7,"title":["HOP: A software tool for production scheduling at Bridgestone\/Firestone off-the-road"],"prefix":"10.1016","volume":"110","author":[{"given":"Zeger","family":"Degraeve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linus","family":"Schrage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00092-7_BIB1","series-title":"Technical report","article-title":"Branch-and-Price: Column Generation for Solving Huge Integer Programs","author":"Barnhart","year":"1996"},{"key":"10.1016\/S0377-2217(98)00092-7_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00092-7_BIB3","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.45.6.789","article-title":"A tire production scheduling system for bridgestone\/firestone off-the-road","volume":"45","author":"Degraeve","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00092-7_BIB4","article-title":"Scheduling Joint Product Operations with Proposal Generation Methods","author":"Degraeve","year":"1992"},{"key":"10.1016\/S0377-2217(98)00092-7_BIB5","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting-stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00092-7_BIB6","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(98)00092-7_BIB7","series-title":"LINDO: Optimization Software for Linear Programming","author":"Schrage","year":"1995"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798000927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:59:06Z","timestamp":1556657946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798000927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0377221798000927"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00092-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}