{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:14:23Z","timestamp":1770743663768,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf02024937","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T07:22:32Z","timestamp":1123831352000},"page":"397-416","source":"Crossref","is-referenced-by-count":9,"title":["Local search procedures for improving feasible solutions to the sequential ordering problem"],"prefix":"10.1007","volume":"43","author":[{"given":"L. F.","family":"Escudero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sciomachen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02024937_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(90)90003-P","volume":"17","author":"B.H. Ahn","year":"1990","unstructured":"B.H. Ahn and J.H. Hyun, Single facility multiclass job scheduling, Comp. Oper. Res. 17(1990)265\u2013272.","journal-title":"Comp. Oper. Res."},{"key":"BF02024937_CR2","unstructured":"N. Ascheuer, L.F. Escudero, M. Groetschel and M. Stoer, A cutting plane approach to the sequential ordering problem, SIAM J., to be published."},{"key":"BF02024937_CR3","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"K.R. Baker,Introduction to Sequencing and Scheduling (Wiley, New York, 1974)."},{"key":"BF02024937_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1990","unstructured":"K.R. Baker and G.D. Scudder, Sequencing and earliness and tardiness penalties: A review, Oper. Res. 38(1990)22\u201336.","journal-title":"Oper. Res."},{"key":"BF02024937_CR5","unstructured":"E. Balas and W.R. Pulleyblank, Precedence constrained routing, Seminar given at the University of Waterloo, Ontario (1989), as credited by M.T.F. Timlin, in: Precedence constrained routing and helicopter scheduling, Ms. Thesis, University of Waterloo (1989)."},{"key":"BF02024937_CR6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J. Bruno","year":"1978","unstructured":"J. Bruno and P. Downey, Complexity of task sequencing with deadlines, setup times and changeover costs, SIAM J. Comput. 7(1978)393\u2013404.","journal-title":"SIAM J. Comput."},{"key":"BF02024937_CR7","volume-title":"Theory of Scheduling","author":"R.W. Convay","year":"1967","unstructured":"R.W. Convay, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1967)."},{"key":"BF02024937_CR8","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"L.F. Escudero","year":"1988","unstructured":"L.F. Escudero, An inexact algorithm for the sequential ordering problem, Eur. J. Oper. Res. 37(1988)236\u2013253.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02024937_CR9","unstructured":"L.F. Escudero, M. Guignard, K. Malik and A. Sciomachen, On Lagrangian-based lower bounds for the sequential ordering problem with time windows and precedence relationships,14th Mathematical Programming Symp., Amsterdam (1991)."},{"key":"BF02024937_CR10","volume-title":"An approximate algorithm for the sequential ordering problem with time windows and precedence relationships","author":"L.F. Escudero","year":"1990","unstructured":"L.F. Escudero and A. Sciomachen, An approximate algorithm for the sequential ordering problem with time windows and precedence relationships, RC-16820, IBM Research, T.J. Watson Research Center, Yorktown Heights, NY (1990)."},{"key":"BF02024937_CR11","unstructured":"L.F. Escudero and A. Sciomachen, AnO(n 3) implementation of an approximate algorithm for finding a feasible solution for the sequential ordering problem, Autofaber Research Report R.R. 8\/90 (1990)."},{"key":"BF02024937_CR12","volume-title":"Optimization in Industrial Environments","author":"L.F. Escudero","year":"1992","unstructured":"L.F. Escudero and A. Sciomachen, Job sequencing ordering problem on a card assembly line, in:Optimization in Industrial Environments, ed. T.A. Ciriani and R.C. Leachman (Wiley, London, 1992)."},{"key":"BF02024937_CR13","volume-title":"Sequencing and Scheduling. An Introduction to the Mathematics of the Job Shop","author":"S. French","year":"1982","unstructured":"S. French,Sequencing and Scheduling. An Introduction to the Mathematics of the Job Shop (Wiley, New York, 1982)."},{"key":"BF02024937_CR14","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","volume":"28","author":"P.C. Kanellakis","year":"1980","unstructured":"P.C. Kanellakis and C.C. Papadimitriou, Local search for the asymmetric travelling salesman problem, Oper. Res. 28(1980)1086\u20131098.","journal-title":"Oper. Res."},{"key":"BF02024937_CR15","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J.K. Lenstra","year":"1978","unstructured":"J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity scheduling under precedence constraints, Oper. Res. 26(1978)22\u201335.","journal-title":"Oper. Res."},{"key":"BF02024937_CR16","volume-title":"Logistics of Production and Inventory","author":"E.L. Lawler","year":"1990","unstructured":"E.L. Lawler, J.K. Lenstra, A.H. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling algorithms and complexity, in:Logistics of Production and Inventory, ed. S.C. Graves, A.H. Rinnooy Kan and P. Zipkin (North-Holland, Amsterdam, 1990)."},{"key":"BF02024937_CR17","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1287\/opre.28.6.1347","volume":"28","author":"H.N. Psaraftis","year":"1980","unstructured":"H.N. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Oper. Res. 28(1980)1337\u20131352.","journal-title":"Oper. Res."},{"key":"BF02024937_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.16.1.1","volume":"16","author":"M. Queyranne","year":"1991","unstructured":"M. Queyranne and Y. Wang, Single machine scheduling polyhedra with precedence constraints, Math. Oper. Res. 16(1991)1\u201320.","journal-title":"Math. Oper. Res."},{"key":"BF02024937_CR19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1111\/j.1937-5956.1992.tb00341.x","volume":"1","author":"D.L. Woodruff","year":"1992","unstructured":"D.L. Woodruff and M.L. Spearman, Sequencing and batching for two classes of jobs with deadlines and setup times, Prod. Oper. Manag. 1(1992)87\u2013102.","journal-title":"Prod. Oper. Manag."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02024937.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02024937\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02024937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:42:46Z","timestamp":1557772966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02024937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF02024937"],"URL":"https:\/\/doi.org\/10.1007\/bf02024937","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}