{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T03:02:37Z","timestamp":1700276557513},"reference-count":22,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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 &amp; Chemical Engineering"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0098-1354(02)00267-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"827-832","source":"Crossref","is-referenced-by-count":13,"title":["Smooth-and-dive accelerator: a pre-MILP primal heuristic applied to scheduling"],"prefix":"10.1016","volume":"27","author":[{"given":"Jeffrey Dean","family":"Kelly","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0098-1354(02)00267-3_BIB1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","article-title":"Tabu search for general zero-one integer programs using the pivot-and-complement heuristic","volume":"6","author":"Aboudi","year":"1994","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S0098-1354(02)00267-3_BIB2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","article-title":"Pivot and complement\u2014a heuristic for 0\u20131 programming","volume":"26","author":"Balas","year":"1980","journal-title":"Management Science"},{"issue":"12","key":"10.1016\/S0098-1354(02)00267-3_BIB3","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1002\/aic.690421209","article-title":"Decomposition techniques for the solution of large-scale scheduling problems","volume":"42","author":"Bassett","year":"1996","journal-title":"American Institute of Chemical Engineering Journal"},{"issue":"2","key":"10.1016\/S0098-1354(02)00267-3_BIB4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00249052","article-title":"A class of smoothing functions for nonlinear and mixed complementarity problems","volume":"5","author":"Chen","year":"1996","journal-title":"Computer Optimization Application"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB5","unstructured":"Dash Optimization Inc. (2002). xpress-optimizer reference manual, Release 2003."},{"issue":"6","key":"10.1016\/S0098-1354(02)00267-3_BIB6","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1287\/opre.27.6.1069","article-title":"Interior path methods for heuristic integer programming procedures","volume":"27","author":"Faaland","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/02331939208843795","article-title":"A special Newton-type optimization method","volume":"24","author":"Fischer","year":"1992","journal-title":"Optimization"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB9","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0098-1354(01)00643-3","article-title":"Short-term scheduling and recipe optimization of blending processes","volume":"25","author":"Glismann","year":"2001","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB10","unstructured":"Goldmann, S. F., Griffiths, J. R., Perez, M., Sinai, J. (1970). Operations scheduling\u2014a quadratic programming approach, Esso Mathematics and System Incorporation, Report No. EMS. 11M70."},{"issue":"7","key":"10.1016\/S0098-1354(02)00267-3_BIB11","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1002\/aic.690450715","article-title":"Smoothing methods for the treatment of complementarity conditions and nested discontinuities in chemical process engineering","volume":"45","author":"Gopal","year":"1999","journal-title":"American Institute of Chemical Engineering Journal"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB12","unstructured":"Jia, Z., Ierapetritou, M., Kelly, J. D. (2002). Refinery short-term scheduling using continuous-time formulation\u2014crude-oil operations. Industrial and Engineering Chemistry Research, February, (in press)."},{"key":"10.1016\/S0098-1354(02)00267-3_BIB13","series-title":"An interior point algorithm to solve computationally difficult set covering problems","author":"Karamarkar","year":"1990"},{"issue":"5","key":"10.1016\/S0098-1354(02)00267-3_BIB14","doi-asserted-by":"crossref","first-page":"1630","DOI":"10.1021\/ie950519h","article-title":"Mixed-integer linear programming model for refinery short-term scheduling of the crude oil unloading with inventory management","volume":"35","author":"Lee","year":"1996","journal-title":"Industrial Engineering Chemistry Research"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB15","series-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB16","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","article-title":"On connections between zero-one integer programming and concave programming under linear constraints","volume":"17","author":"Raghavachari","year":"1969","journal-title":"Operation Research"},{"issue":"4","key":"10.1016\/S0098-1354(02)00267-3_BIB17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","article-title":"Randomized rounding: a technique for provably good algorithms and algorithmic proofs","volume":"7","author":"Raghavan","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB18","series-title":"Optimization in operations research","author":"Rardin","year":"1998"},{"issue":"4","key":"10.1016\/S0098-1354(02)00267-3_BIB19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0098-1354(91)85012-J","article-title":"Reformulation of multiperiod MILP models for planning and scheduling of chemical processes","volume":"15","author":"Sahinidis","year":"1991","journal-title":"Computers and Chemical Engineering"},{"issue":"Suppl. B","key":"10.1016\/S0098-1354(02)00267-3_BIB20","doi-asserted-by":"crossref","first-page":"S1227","DOI":"10.1016\/0098-1354(96)00212-8","article-title":"Mathematical programming techniques for crude oil scheduling","volume":"20","author":"Shah","year":"1996","journal-title":"Computers and Chemical Engineering"},{"issue":"5","key":"10.1016\/S0098-1354(02)00267-3_BIB21","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0098-1354(83)80006-4","article-title":"Exxon experience with large scale linear and nonlinear programming applications","volume":"7","author":"Simon","year":"1983","journal-title":"Computers and Chemical Engineering"},{"key":"10.1016\/S0098-1354(02)00267-3_BIB22","series-title":"Integer programming","author":"Wolsey","year":"1998"}],"container-title":["Computers &amp; Chemical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135402002673?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135402002673?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:58:11Z","timestamp":1553932691000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0098135402002673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0098135402002673"],"URL":"https:\/\/doi.org\/10.1016\/s0098-1354(02)00267-3","relation":{},"ISSN":["0098-1354"],"issn-type":[{"value":"0098-1354","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}