{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:14Z","timestamp":1759847474476,"version":"3.40.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["Annals of Operations Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1021149204501","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:40:25Z","timestamp":1048207225000},"page":"147-172","source":"Crossref","is-referenced-by-count":7,"title":["Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment"],"prefix":"10.1007","volume":"115","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5101086_CR1","unstructured":"N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, Ph.D. Thesis, Technische Universit\u00e4t Berlin (1995)."},{"key":"5101086_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"P. Baptiste","year":"2001","unstructured":"P. Baptiste, C. Le Pape and W. Nuijten, Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems (Kluwer, Dordrecht, 2001)."},{"key":"5101086_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"J. Blazewicz, W. Domschke and E. Pesch, The job shop scheduling problem: conventional and new solution techniques, European Journal of Operational Research 93 (1996) 1-33.","journal-title":"European Journal of Operational Research"},{"key":"5101086_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P. Brucker","year":"1996","unstructured":"P. Brucker and O. Thiele, A branch and bound method for the general-shop problem with sequence dependent setup-times, OR Spektrum 18 (1996) 145-161.","journal-title":"OR Spektrum"},{"key":"5101086_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018995317468","volume":"96","author":"Y. Crama","year":"2000","unstructured":"Y. Crama, V. Kats, J. van de Klundert and E. Levner, Cyclic scheduling in robotic flowshops, Annals of Operations Research 96 (2000) 97-124.","journal-title":"Annals of Operations Research"},{"key":"5101086_CR6","first-page":"35","volume-title":"Handbooks in Operations Research and Management Science, Vol. 8","author":"J. Desrosiers","year":"1995","unstructured":"J. Desrosiers, Y. Dumas, M. Solomon and F. Soumis, Time constrained routing and scheduling, in: Handbooks in Operations Research and Management Science, Vol. 8, eds. M.O. Ball et al. (Elsevier, Amsterdam, 1995) pp. 35-139."},{"key":"5101086_CR7","volume-title":"Handbook on Recent Advances in Project Scheduling","author":"U. Dorndorf","year":"1998","unstructured":"U. Dorndorf, T. Phan Huy and E. Pesch, A survey of interval capacity consistency tests for timeand resource-constrained scheduling, in: Handbook on Recent Advances in Project Scheduling, ed. J. Waglarz (Kluwer, Dordrecht, 1998)."},{"key":"5101086_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y. Dumas","year":"1995","unstructured":"Y. Dumas, J. Desrosiers and E. Gelinas, An optimal algorithm for the traveling salesman problem with time windows, Operations Research 43 (1995) 367-371.","journal-title":"Operations Research"},{"key":"5101086_CR9","unstructured":"F. Focacci and W. Nuijten, A constraint propagation algorithm for scheduling with sequence dependent setup times, in: Proceedings of the 2nd International Workshop, CP-AI-OR'00, Paderborn, Germany (2000)."},{"key":"5101086_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"R. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy-Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics 5 (1979) 287-326.","journal-title":"Annals of Discrete Mathematics"},{"key":"5101086_CR11","unstructured":"J. Hurink and S. Knust, Tabu search algorithms for job-shop problems with a single transport robot, Osnabr\u00fccker Schriften zur Mathematik, Reihe P, Nr. 231, 2001."},{"key":"5101086_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0166-218X(01)00273-6","volume":"119","author":"J. Hurink","year":"2002","unstructured":"J. Hurink and S. Knust, A tabu search algorithm for scheduling a single robot in a job-shop environment, Discrete Applied Mathematics 119 (2002) 181-203.","journal-title":"Discrete Applied Mathematics"},{"key":"5101086_CR13","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A.S. Jain","year":"1999","unstructured":"A.S. Jain and S. Meeran, Deterministic job-shop scheduling: past, present and future, European Journal of Operational Research 113 (1999) 390-434.","journal-title":"European Journal of Operational Research"},{"key":"5101086_CR14","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R. Klein","year":"1999","unstructured":"R. Klein and A. Scholl, Computing lower bounds by destructive improvement-an application to resource-constrained project scheduling, European Journal of Operational Research 112 (1999) 322-346.","journal-title":"European Journal of Operational Research"},{"key":"5101086_CR15","unstructured":"S. Knust, Shop-scheduling problems with transportation, Ph.D. Thesis, Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik\/Informatik (1999)."},{"key":"5101086_CR16","volume-title":"A time-oriented approach to computing optimal schedules for the job shop scheduling problem","author":"P.B. Martin","year":"1996","unstructured":"P.B. Martin, A time-oriented approach to computing optimal schedules for the job shop scheduling problem, Ph.D. Thesis, Graduate School of Cornell University, USA (1996)."},{"key":"5101086_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K. Marriott","year":"1998","unstructured":"K. Marriott and P. Stuckey, Programming with Constraints: An Introduction (MIT Press, Cambridge, MA, 1998)."},{"key":"5101086_CR18","volume-title":"Optimization and Computational Logic","author":"K. McAloon","year":"1996","unstructured":"K. McAloon and C. Tretkoff, Optimization and Computational Logic (Wiley, New York, 1996)."},{"key":"5101086_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/opre.45.3.365","volume":"45","author":"A. Mingozzi","year":"1997","unstructured":"A. Mingozzi, L. Bianco and S. Ricciardelli, Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints, Operations Research 45 (1997) 365-377.","journal-title":"Operations Research"},{"key":"5101086_CR20","volume-title":"Industrial Scheduling","author":"J.F. Muth","year":"1963","unstructured":"J.F. Muth and G.L. Thompson, Industrial Scheduling (Prentice-Hall, Englewood Cliffs, NJ, 1963)."},{"key":"5101086_CR21","unstructured":"M. Queyranne and A. Schulz, Polyhedral approaches to machine scheduling, Preprint No. 408, TU Berlin (1994)."},{"key":"5101086_CR22","unstructured":"S. Seibert, Untere Schranken f\u00fcr das Traveling Salesman Problem mit Zeitfenstern und verallgemeinerten Nachfolgebeziehungen, Diplomarbeit, Universit\u00e4t Osnabr\u00fcck, Fachbereich Mathematik\/Informatik (2000)."},{"key":"5101086_CR23","volume-title":"Foundations of Constraint Satisfaction","author":"E.P.K. Tsang","year":"1993","unstructured":"E.P.K. Tsang, Foundations of Constraint Satisfaction (Academic Press, New York, 1993)."},{"key":"5101086_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J.M. Van den Akker","year":"2000","unstructured":"J.M. Van den Akker, C.A.J. Hurkens and M.W.P. Savelsbergh, Time-indexed formulations formachine scheduling problems: column generation, INFORMS Journal on Computing 12 (2000) 111-124.","journal-title":"INFORMS Journal on Computing"},{"key":"5101086_CR25","volume-title":"Constraint Satisfaction in Logic Programming","author":"V. P. Hentenryck","year":"1989","unstructured":"Van P. Hentenryck, Constraint Satisfaction in Logic Programming (MIT Press, Cambridge, MA, 1989)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021149204501.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021149204501\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021149204501.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:12:39Z","timestamp":1747577559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021149204501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":25,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5101086"],"URL":"https:\/\/doi.org\/10.1023\/a:1021149204501","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}