{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:50:17Z","timestamp":1771260617095,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"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":[[1999,11]]},"DOI":"10.1016\/s0377-2217(98)00326-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"524-548","source":"Crossref","is-referenced-by-count":54,"title":["Two simulated annealing-based heuristics for the job shop scheduling problem"],"prefix":"10.1016","volume":"118","author":[{"given":"K.","family":"Steinh\u00f6fel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Albrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.K.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00326-9_BIB1","unstructured":"E.H.L. Aarts, Local Search in Combinatorial Optimization. Wiley, New York, 1998"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB2","unstructured":"E.H.L. Aarts, J.H.M. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach. Wiley, New York, 1989"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB3","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","article-title":"A computational study of local search algorithms for shop scheduling","volume":"6","author":"Aarts","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB4","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"issue":"8","key":"10.1016\/S0377-2217(98)00326-9_BIB5","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/12.609278","article-title":"Optimal placements of flexible objects (Part I: The unbounded case)","volume":"46","author":"Albrecht","year":"1997","journal-title":"IEEE Transactions on Computers"},{"issue":"8","key":"10.1016\/S0377-2217(98)00326-9_BIB6","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/12.609279","article-title":"Optimal placements of flexible objects (Part II: A simulated annealing approach for the bounded case)","volume":"46","author":"Albrecht","year":"1997","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"10.1016\/S0377-2217(98)00326-9_BIB7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0378-4754(97)00072-4","article-title":"Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds","volume":"44","author":"Albrecht","year":"1997","journal-title":"Mathematics and Computers in Simulation"},{"issue":"2","key":"10.1016\/S0377-2217(98)00326-9_BIB8","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1006\/jcph.1997.5781","article-title":"Stochastic simulations of two-dimensional composite packings","volume":"136","author":"Albrecht","year":"1997","journal-title":"Journal of Computational Physics"},{"issue":"2","key":"10.1016\/S0377-2217(98)00326-9_BIB9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of job-shop scheduling","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB10","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","article-title":"Machine sequencing via disjunctive graphs: An implicit enumeration algorithm","volume":"17","author":"Balas","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetics and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB12","unstructured":"J.L. Bruno, E.G. Coffman Jr., P.R. Winters (Eds.), Computer and Job Shop Scheduling Theory. Wiley, New York, 1976"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB13","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB14","unstructured":"V. \u010cerny, A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm, Preprint, Institute of Physics and Biophysics, Comenius University, Bratislava, 1982 (see also: J. Optim. Theory Appl. 45 (1985) 41\u201351)"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB15","doi-asserted-by":"crossref","unstructured":"E.G. Coffman Jr., L. Flatto, P.E. Wright, Optimal stochastic allocation of machines under waiting-time constraints, SIAM Journal on Computing 22 (2) (1993) 332\u2013348","DOI":"10.1137\/0222025"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1018978322417","article-title":"Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time","volume":"70","author":"Crauwels","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job-shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB18","unstructured":"L. Finta, Z. Liu, Single Machine Scheduling Subject to Precedence Delays, RR-2198, INRIA, 1994"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity results for multiprocessor scheduling under resource constraints","volume":"44","author":"Garey","year":"1975","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB20","doi-asserted-by":"crossref","unstructured":"H.J. Goltz, Reducing domains for search in CLP(FD) and its application to job shop scheduling, in: U. Montanari, F. Rossi (Eds.), First International Conference on Principles and Practice of Constraint Programming (CP'95), Lecture Notes in Computer Science, vol. 976, Springer, Cassis, 1995, pp. 549\u2013562","DOI":"10.1007\/3-540-60299-2_33"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB21","unstructured":"H.J. Goltz, U. John, Methods for solving practical problems of job shop scheduling modelled in CLP(FD), in: M. Wallace (Ed.), PACT'96 \u2013 Practical Application of Constraint Technology, London, 1996, pp. 73\u201392"},{"issue":"2","key":"10.1016\/S0377-2217(98)00326-9_BIB22","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BF02522821","article-title":"Using quadratic programming to solve high multiplicity scheduling problems on parallel machines","volume":"17","author":"Granot","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1018913902852","article-title":"Single machine hierarchical scheduling with customer orders and multiple job classes","volume":"70","author":"Gupta","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB24","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018903027868","article-title":"Single machine scheduling with batch set-up times to minimize maximum lateness","volume":"70","author":"Hariri","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB26","unstructured":"J.A. Hoogeveen, J.K. Lenstra, S.L. van de Velde, Sequencing and scheduling: An annotated bibliography, Technical Report COSOR 97\u20132, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1997"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB27","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671\u2013680","DOI":"10.1126\/science.220.4598.671"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB28","unstructured":"G.M. Koole, Stochastic scheduling and dynamic programming. CWI TRACT, vol. 113. CWI, Amsterdam, The Netherlands, 1995"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB29","unstructured":"S. Lawrence, Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (Supplement), Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1984"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB30","doi-asserted-by":"crossref","unstructured":"C.Y. Lee, L. Lei (Eds.), Scheduling: Theory and Applications, Annals of Operations Research, vol. 70 (1997)","DOI":"10.1023\/A:1018909801944"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","article-title":"Current trends in deterministic scheduling","volume":"70","author":"Lee","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB32","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1018965919691","article-title":"Single machine scheduling problem with common due window and controllable processing times","volume":"70","author":"Liman","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(98)00326-9_BIB33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S0097539791218949","article-title":"Stochastic scheduling with variable profile and precedence constraints","volume":"26","author":"Liu","year":"1997","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"10.1016\/S0377-2217(98)00326-9_BIB34","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"The Journal of Chemical Physics"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB35","unstructured":"J.F. Muth, G.L. Thompson, P.R. Winters (Eds.), Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, 1963"},{"issue":"2","key":"10.1016\/S0377-2217(98)00326-9_BIB36","first-page":"145","article-title":"Random keys genetic algorithm for job-shop scheduling","volume":"3","author":"Norman","year":"1997","journal-title":"Engineering Design and Automation"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB37","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast tabu search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB38","unstructured":"M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall International Series in Industrial and Systems Engineering, Prentice Hall, Englewood Cliffs, NJ, 1995"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB39","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01759049","article-title":"A theoretical framework for simulated annealing","volume":"6","author":"Romeo","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB40","unstructured":"B. Roy, B. Sussmann, Les probl\u00e8mes d'Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","article-title":"Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem","volume":"861","author":"Sadeh","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB42","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02601640","article-title":"Focused simulated annealing search: An application to job shop scheduling","volume":"63","author":"Sadeh","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB43","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01759051","article-title":"Efficient simulated annealing on fractal energy landscapes","volume":"6","author":"Sorkin","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB44","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB45","doi-asserted-by":"crossref","unstructured":"J.D. Ullman, NP-complete scheduling problems, Journal of Computer and System Science 10 (3) (1975) 384\u2013393","DOI":"10.1016\/S0022-0000(75)80008-0"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB46","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/ijoc.8.3.302","article-title":"Job shop scheduling by local search","volume":"8","author":"Vaessens","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB47","doi-asserted-by":"crossref","unstructured":"P.J.M. Van Laarhoven, E.H.L. Aarts, Simulated Annealing: Theory and Applications, Reidel, Dordrecht, 1988","DOI":"10.1007\/978-94-015-7744-1"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB48","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"401","author":"Van Laarhoven","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00326-9_BIB49","unstructured":"T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job shop problems, in: R. Manner, B. Manderick (Eds.), Parallel Problem Solving from Nature 2, North-Holland, Amsterdam, 1992, 281\u2013290"},{"issue":"6","key":"10.1016\/S0377-2217(98)00326-9_BIB50","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1137\/S0097539794266407","article-title":"On unapproximable versions of NP-complete problems","volume":"25","author":"Zuckerman","year":"1996","journal-title":"SIAM Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:01:49Z","timestamp":1579024909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0377221798003269"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00326-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}