{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:42:33Z","timestamp":1758818553425,"version":"3.40.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1009669326107","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"481-500","source":"Crossref","is-referenced-by-count":14,"title":["Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems"],"prefix":"10.1007","volume":"6","author":[{"given":"Irfan M.","family":"Ovacik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikanth","family":"Rajagopalan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reha","family":"Uzsoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"270680_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01581033","volume":"22","author":"C.G.E. Boender","year":"1982","unstructured":"Boender, C.G.E., A.H.G. Rinnooy Kan, L. Stougie, and G.T. Timmer. (1982). \u201cA Stochastic Method for Global Optimization.\u201d Mathematical Programming 22, 125\u2013140.","journal-title":"Mathematical Programming"},{"key":"270680_CR2","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1287\/mnsc.23.12.1273","volume":"23","author":"D. Dannenbring","year":"1977","unstructured":"Dannenbring, D. (1977). \u201cEstimating Optimal Solutions for Large Combinatorial Problems.\u201d Management Science 23, 1273\u20131283.","journal-title":"Management Science"},{"key":"270680_CR3","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1287\/opre.33.5.1024","volume":"33","author":"U. Derigs","year":"1985","unstructured":"Derigs, U. (1985). \u201cUsing Confidence Limits for the Global Optimal in Combinatorial Optimization.\u201d Operations Research 33, 1024\u20131049.","journal-title":"Operations Research"},{"key":"270680_CR4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1017\/S0305004100015681","volume":"24","author":"R. Fisher","year":"1928","unstructured":"Fisher, R. and L. Tippett. (1928). \u201cLimiting Forms of the Frequency Distribution of the Largest or Smallest Member of a Sample.\u201d Proceedings of the Cambridge Philosophical Society 24, 180\u2013190.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"270680_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman."},{"key":"270680_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search Part I.\u201d ORSA Journal on Computing 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"270680_CR7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search Part II.\u201d ORSA Journal on Computing 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"270680_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800260108","volume":"26","author":"B.L. Golden","year":"1979","unstructured":"Golden, B.L. and F.B. Alt. (1979). \u201cInterval Estimation of a Global Optimum for Large Combinatorial Problems.\u201d Naval Research Logistics Quarterly 26, 69\u201377.","journal-title":"Naval Research Logistics Quarterly"},{"key":"270680_CR9","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"B.L. Golden","year":"1985","unstructured":"Golden, B.L. and W.R. Stewart. (1985). \u201cEmpirical Analysis of Heuristics.\u201d In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: John Wiley."},{"key":"270680_CR10","volume-title":"Simulation Modeling and Analysis","author":"A.M. Law","year":"1982","unstructured":"Law, A.M. and W.D. Kelton. (1982). Simulation Modeling and Analysis. New York: McGraw-Hill."},{"volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1990","key":"270680_CR11","unstructured":"Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.). (1990). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: John Wiley."},{"key":"270680_CR12","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. (1993). \u201cSequencing and Scheduling: Algorithms and Complexity.\u201d In S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin (eds.), Handbooks in Operations Research and Management Science Vol. 4: Logistics of Production and Inventory. North-Holland.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"270680_CR13","series-title":"Mathematical Centre Tract 69","volume-title":"Sequencing by Enumerative Methods","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K. (1977). Sequencing by Enumerative Methods. Mathematical Centre Tract 69, Mathematisch Centrum, Amsterdam."},{"key":"270680_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0191-2615(82)90030-3","volume":"16B","author":"M. Los","year":"1982","unstructured":"Los, M. and M.C. Lardinois. (1982). \u201cCombinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem.\u201d Transportation Research 16B, 89\u2013124.","journal-title":"Transportation Research"},{"key":"270680_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M. Lundy","year":"1986","unstructured":"Lundy, M. and A. Mees. (1986). \u201cConvergence of an Annealing Algorithm.\u201d Mathematical Programming 34, 111\u2013124.","journal-title":"Mathematical Programming"},{"key":"270680_CR16","unstructured":"Matsuo, H., C.J. Suh, and R.S. Sullivan. (1987). \u201cA Controlled Search Simulated Annealing Method for the Single Machine Weighted Tardiness Problem.\u201d Working Paper #87\u201312\u20132, Dept. of Management, Graduate School of Business, University of Texas at Austin."},{"key":"270680_CR17","unstructured":"Matsuo, H., C.J. Suh, and R.S. Sullivan. (1988). \u201cA Controlled Search Simulated Annealing Method for the General Job Shop Scheduling Problem.\u201d Working Paper 03\u201304\u201388, Department of Management, University of Texas at Austin."},{"key":"270680_CR18","doi-asserted-by":"crossref","unstructured":"Ovacik, I.M. and R. Uzsoy. (1994). \u201cRolling Horizon Algorithms for a Single Machine Dynamic Scheduling Problem with Sequence-Dependent Setup Times.\u201d International Journal of Production Research, forthcoming.","DOI":"10.1080\/00207549408956998"},{"key":"270680_CR19","volume-title":"Discrete Optimization","author":"R.G. Parker","year":"1988","unstructured":"Parker, R.G. and R.L. Rardin. (1988). Discrete Optimization. Boston: Academic Press."},{"key":"270680_CR20","unstructured":"Sadeh, N. and Y. Nakakuki. (1994). \u201cFocused Simulated Annealing: An Application to Job Shop Scheduling.\u201d Research Report, Center for Integrated Manufacturing Decision Systems, The Robotics Institute, Carnegie-Mellon University."},{"key":"270680_CR21","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/1520-6750(199204)39:3<369::AID-NAV3220390307>3.0.CO;2-F","volume":"39","author":"R. Uzsoy","year":"1992","unstructured":"Uzsoy, R., C.Y. Lee, and L.A. Martin-Vega. (1992). \u201cScheduling Semiconductor Test Operations: Minimizing Maximum Lateness and Number of Tardy Jobs on a Single Machine.\u201d Naval Research Logistics 39, 369\u2013388.","journal-title":"Naval Research Logistics"},{"key":"270680_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Van Laarhoven","year":"1987","unstructured":"Van Laarhoven, P.J.M. and E.H.L. Aarts. (1987). Simulated Annealing: Theory and Applications. Dordrecht, Holland: Dortmund Reidel."},{"key":"270680_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Van Laarhoven","year":"1992","unstructured":"Van Laarhoven, P.J.M., E.H.L. Aarts, and J.K. Lenstra. (1992). \u201cJob Shop Scheduling by Simulated Annealing.\u201d Operations Research 40, 113\u2013125.","journal-title":"Operations Research"},{"key":"270680_CR24","first-page":"63","volume":"7","author":"S.H. Zanakis","year":"1977","unstructured":"Zanakis, S.H. (1977). \u201cComputational Experience with Some Nonlinear Optimization Algorithms for Deriving Maximum Likelihood Estimates for Three Parameter Weibull Distribution.\u201d TIMS Studies in Management Science 7, 63\u201377.","journal-title":"TIMS Studies in Management Science"},{"key":"270680_CR25","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1080\/00949657908810302","volume":"9","author":"S.H. Zanakis","year":"1979","unstructured":"Zanakis, S.H. (1979). \u201cA Simulation Study of Some Simple Estimators of the Three-Parameter Weibull Distribution.\u201d Journal of Statistical Computing and Simulation 9, 419\u2013428.","journal-title":"Journal of Statistical Computing and Simulation"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009669326107.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009669326107\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009669326107.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:50:30Z","timestamp":1747651830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009669326107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["270680"],"URL":"https:\/\/doi.org\/10.1023\/a:1009669326107","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}