{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:33:19Z","timestamp":1780720399869,"version":"3.54.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":[[2002,4]]},"DOI":"10.1016\/s0377-2217(01)00140-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"29-42","source":"Crossref","is-referenced-by-count":33,"title":["Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure"],"prefix":"10.1016","volume":"138","author":[{"given":"Janne","family":"Rosl\u00f6f","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iiro","family":"Harjunkoski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tapio","family":"Westerlund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johnny","family":"Isaksson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00140-0_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job-shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB2","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","article-title":"Disjunctive programming and hierarchy of relaxations for discrete optimization problems","volume":"6","author":"Balas","year":"1985","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB3","doi-asserted-by":"crossref","first-page":"S11","DOI":"10.1016\/S0098-1354(99)80004-0","article-title":"Automated reformulation of disjunctive constraints in MINLP optimization","volume":"23","author":"Bj\u00f6rkqvist","year":"1999","journal-title":"Computers & Chemical Engineering"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB4","unstructured":"CPLEX \u2013 Users Guide, ILOG Inc., CPLEX Division, 1998"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/opre.16.2.353","article-title":"A branch-bound solution to the general scheduling problem","volume":"16","author":"Greenberg","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB6","doi-asserted-by":"crossref","first-page":"4341","DOI":"10.1021\/ie970927g","article-title":"Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes","volume":"37","author":"Ierapetritou","year":"1998","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production scheduling with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0098-1354(93)80015-F","article-title":"A general algorithm for short-term scheduling of batch operations \u2013 I. MILP formulation","volume":"17","author":"Kondili","year":"1993","journal-title":"Computers & Chemical Engineering"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/07408179708966311","article-title":"A heuristic to minimize the total weighted tardiness with sequence-dependent setups","volume":"29","author":"Lee","year":"1997","journal-title":"IIE Transactions"},{"issue":"9","key":"10.1016\/S0377-2217(01)00140-0_BIB10","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1002\/aic.690430914","article-title":"Bridging the gap between heuristics and optimization: Capacity expansion case","volume":"43","author":"Liu","year":"1997","journal-title":"AIChE Journal"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/00207549308956713","article-title":"Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling","volume":"31","author":"MacCarthy","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1021\/ie970311r","article-title":"Continuous time representation approach to batch and continuous process scheduling: 1. MINLP formulation","volume":"38","author":"Mockus","year":"1999","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA, The International Journal of Management Science"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB14","unstructured":"Pantelides, C.C., 1994. Unified frameworks for optimal process planning and scheduling. In: Proceedings of the Second International Conference on Foundations of Computer Aided Process Operations, CACHE Publications, Austin, TX, USA"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB15","unstructured":"Pekny, J.F., Reklaitis, G.V., 1998. Towards the convergence of theory and practice: A technology guide for scheduling\/planning methodology. In: Proceedings of Foundations of Computer Aided Process Operations Conference, Snowbird, Utah, USA"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB16","series-title":"Scheduling: Theory, Applications and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB17","doi-asserted-by":"crossref","first-page":"S861","DOI":"10.1016\/S0098-1354(99)80214-2","article-title":"A short-term scheduling problem in the paper-converting industry","volume":"23","author":"Rosl\u00f6f","year":"1999","journal-title":"Computers & Chemical Engineering"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","article-title":"Scheduling in a sequence dependent setup environment with genetic search","volume":"22","author":"Rubin","year":"1995","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB19","doi-asserted-by":"crossref","first-page":"S1221","DOI":"10.1016\/0098-1354(96)00211-6","article-title":"A simple continuous-time process scheduling formulation and a novel solution algorithmic","volume":"20","author":"Schilling","year":"1996","journal-title":"Computers & Chemical Engineering"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB20","unstructured":"Shah, N., 1998. Single- and multisite planning and scheduling: Current status and future challenges. In: Proceedings of Foundations of Computer Aided Process Operations Conference, Snowbird, Utah, USA"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB21","doi-asserted-by":"crossref","first-page":"S403","DOI":"10.1016\/S0098-1354(98)00081-7","article-title":"Improving the efficiency of discrete time scheduling formulation","volume":"22","author":"Yee","year":"1998","journal-title":"Computers & Chemical Engineering"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","article-title":"Insertion techniques for the heuristic solution of the job shop problem","volume":"58","author":"Werner","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00140-0_BIB23","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/0098-1354(96)81812-6","article-title":"MILP model for scheduling and design of a special class of multipurpose batch plants","volume":"20","author":"Voudouris","year":"1996","journal-title":"Computers & Chemical Engineering"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001400?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001400?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T20:24:44Z","timestamp":1556569484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701001400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0377221701001400"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00140-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}