{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T15:31:29Z","timestamp":1762875089272},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424215"},{"type":"electronic","value":"9783540446293"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44629-x_17","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T14:09:20Z","timestamp":1183385360000},"page":"277-293","source":"Crossref","is-referenced-by-count":20,"title":["Resource-Constrained Project Scheduling and Timetabling"],"prefix":"10.1007","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"17_CR1","volume-title":"Network Flows: Theory, Algorithms and Application","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, L.: Network Flows: Theory, Algorithms and Application. Prentice-Hall, Englewood Cliffs, NJ (1993)"},{"key":"17_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"1998","unstructured":"Brucker, P.: Scheduling Algorithms. Springer-Verlag, Berlin Heidelberg New York (1998)"},{"unstructured":"Brucker, P.: Complex Scheduling Problems Osnabr\u201ducker Schriften zur Mathematik, Reihe P, Heft 214 (1999)","key":"17_CR3"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u201dohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods. Eur. J. Oper. Res. 112 (1999) 3\u201314","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P. Brucker","year":"1994","unstructured":"Brucker, P., Jurisch, B., Sievers, B.: A Branch & Bound Algorithm for the Job-Shop Problem. Discrete Appl. Math. 49 (1994) 107\u2013127","journal-title":"Discrete Appl. Math"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(199907\/08)2:4<157::AID-JOS23>3.0.CO;2-Z","volume":"2","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Schumacher, D.: A New Tabu Search Procedure for an Audit-Scheduling Problem. J. Scheduling 2 (1999) 157\u2013173","journal-title":"J. Scheduling"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:2000103","volume":"34","author":"J. Carlier","year":"2000","unstructured":"Carlier, J., Neron, E.: An Exact Method for Solving the Multi-Processor Flow-Shop. RAIRO Oper. Res. 34 (2000) 1\u201325","journal-title":"RAIRO Oper. Res"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., Pinson, E.: An Algorithm for Solving the Job-Shop Problem. Manage. Sci. 35 (1989) 164\u2013176","journal-title":"Manage. Sci"},{"doi-asserted-by":"crossref","unstructured":"Dorndorf, U., Phan Huy, T., Pesch, E.: A Survey of Interval Capacity Consistency Tests for Time-and Resource-Constrained Scheduling. In: W\u0119glarz J. (ed.): Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1999) 213\u2013238","key":"17_CR9","DOI":"10.1007\/978-1-4615-5533-9_10"},{"unstructured":"Dorndorf, U., Pesch, E., Phan Huy, T.: Solving the Open Shop Scheduling Problem. J. Scheduling (1999) (to appear)","key":"17_CR10"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the Complexity of Timetabling and Multicommodity Flow Problems. SIAM J. Comput. 5 (1976) 691\u2013703","journal-title":"SIAM J. Comput"},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-49201-1_22","volume-title":"Practical Aspects of Declarative Languages","author":"H.-J. Goltz","year":"1999","unstructured":"Goltz, H.-J., Matzke, D.: University Timetabling Using Constraint Logic Programming. In: Gupta G. (ed.): Practical Aspects of Declarative Languages. Lecture Notes in Computer Science, Vol. 1551. Springer-Verlag, Berlin Heidelberg New York (1999) 320\u2013334"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R. Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and Parallel Resource-Constrained Project S cheduling Methods Revisited: Theory and Computation. Eur. J. Oper. Res. 90 (1996) 320\u2013333","journal-title":"Eur. J. Oper. Res"},{"unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. In: W\u0119glarz J. (ed.): Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1999) 147\u2013178","key":"17_CR14"},{"doi-asserted-by":"crossref","unstructured":"Martin, P.B., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job Shop Scheduling Problem. Proc. 5th Int. IPCO Conference (1996)","key":"17_CR15","DOI":"10.1007\/3-540-61310-2_29"},{"unstructured":"Schaerf, A.: A Survey of Automated Timetabling. CWI-Report CS-R 9567. Amsterdam (1995)","key":"17_CR16"},{"unstructured":"Schaerf, A.: Tabu Search Techniques for Large High-School Time-Tabling Problems. CWI-Report CS-R 9611. Amsterdam (1996)","key":"17_CR17"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A. Sprecher","year":"1998","unstructured":"Sprecher, A., Drexl, A.: Solving Multi-mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Eur. J. Oper. Res. 107 (1998) 431\u2013450","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra","year":"1985","unstructured":"de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151\u2013162","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44629-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:57:54Z","timestamp":1550404674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44629-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424215","9783540446293"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44629-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}