{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:03:20Z","timestamp":1769022200321,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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 & Operations Research"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0305-0548(00)00061-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"123-149","source":"Crossref","is-referenced-by-count":43,"title":["Local search heuristics for two-stage flow shop problems with secondary criterion"],"prefix":"10.1016","volume":"29","author":[{"given":"Jatinder N.D.","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Hennig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0305-0548(00)00061-7_BIB1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0305-0483(88)90008-4","article-title":"Bicriterion static scheduling research for a single machine","volume":"16","author":"Dileepan","year":"1988","journal-title":"OMEGA"},{"issue":"6","key":"10.1016\/S0305-0548(00)00061-7_BIB2","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/0305-0483(89)90063-7","article-title":"A framework for single machine multiple objective sequencing research","volume":"17","author":"Fry","year":"1989","journal-title":"OMEGA"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB3","unstructured":"Hoogeveen H. Single-machine bicriteria scheduling. Ph.D. dissertation, Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1992."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB4","doi-asserted-by":"crossref","unstructured":"Lee C-Y, Vairaktarakis GL. Complexity of single machine hierarchical scheduling: a survey. Research Report No. 93-10, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA, 1993.","DOI":"10.1142\/9789814354363_0013"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","article-title":"Multiple and bicriteria scheduling: a literature survey","volume":"81","author":"Nagar","year":"1995","journal-title":"Eur. J. Opl. Res."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB6","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH, editors. Logistics of Production and Inventory. Amsterdam, The Netherlands: North-Holland, 1995. p. 445\u2013522."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with set-up times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistic Quarterly"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flow shop and job shop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Maths. Ops. Res."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB9","unstructured":"Chen CL, Bulfin RL. Complexity results for multi-machine multi-criteria scheduling problems. Proceedings of the Third Industrial Engineering Research Conference, 1994; p. 662\u20135."},{"issue":"9","key":"10.1016\/S0305-0548(00)00061-7_BIB10","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1992.126","article-title":"Two-stage flow shop scheduling problem with bicriteria","volume":"43","author":"Rajendran","year":"1992","journal-title":"J. Ops. Res. Soc."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB11","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","article-title":"Genetic algorithms for the two-stage bicriteria flow shop problem","volume":"95","author":"Neppalli","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/095372899233217","article-title":"Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion","volume":"10","author":"Gupta","year":"1999","journal-title":"Production Planning and Control: An International Journal"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0925-5273(00)00039-6","article-title":"Minimizing total flow time in a 2-machine flow shop problem with minimum makespan","volume":"69","author":"Gupta","year":"2001","journal-title":"International Journal of production Economics"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0895-7177(99)00085-0","article-title":"A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size","volume":"29","author":"Danneberg","year":"1999","journal-title":"Math. Comput. Modell."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01539731","article-title":"Heuristics for permutation flow shop scheduling with batch setup times","volume":"18","author":"Sotskov","year":"1996","journal-title":"OR Spektrum"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB16","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":"Journal of Chemical Physics"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem","volume":"45","author":"Cerny","year":"1985","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","article-title":"Convergence of an annealing algorithm","volume":"34","author":"Lundy","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB21","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF02156631","article-title":"A comparison of local search methods for flow shop scheduling","volume":"63","author":"Glass","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB22","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB23","series-title":"Modern heuristic techniques for combinatorial problems","author":"Reeves","year":"1993"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB24","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","article-title":"Large-step Markov chain for the TSP incorporating local search heuristics","volume":"11","author":"Martin","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(95)00030-U","article-title":"Improving local search heuristics for some scheduling problems","volume":"65","author":"Brucker","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0166-218X(96)00036-4","article-title":"Improving local search heuristics for some scheduling problems. Part II","volume":"72","author":"Brucker","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB27","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(95)00012-F","article-title":"Job-shop scheduling: computational study of large-step optimization methods","volume":"83","author":"Louren\u00e7o","year":"1995","journal-title":"Eur. J. Opl. Res."},{"key":"10.1016\/S0305-0548(00)00061-7_BIB28","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"},{"key":"10.1016\/S0305-0548(00)00061-7_BIB29","unstructured":"Gupta JND, Lauff V, Werner F. An enumerative algorithm for two-machine flow shop problems with earliness and tardiness penalties. Preprint 33\/99, Otto-von-Guericke-Universit\u00e4t, FMA, Magdeburg, 1999."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000617?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000617?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:23:57Z","timestamp":1555748637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0305054800000617"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00061-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}