{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:50Z","timestamp":1725486170800},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_23","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:45:12Z","timestamp":1181601912000},"page":"268-279","source":"Crossref","is-referenced-by-count":3,"title":["Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints"],"prefix":"10.1007","author":[{"given":"Monaldo","family":"Mastrolilli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"unstructured":"M. R. Garey and D. S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979.","key":"23_CR1"},{"key":"23_CR2","first-page":"287","volume":"5","author":"R. Graham","year":"1979","unstructured":"R. Graham, E. Lawler, J. Lenstra, and A. R. Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. volume 5, pages 287\u2013326. North-Holland, 1979.","journal-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey"},{"doi-asserted-by":"crossref","unstructured":"L. A. Hall and D. B. Shmoys. Approximation algorithms for constrained schedulingproblems. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS 1989), pages 134\u2013139, 1989.","key":"23_CR3","DOI":"10.1109\/SFCS.1989.63468"},{"unstructured":"L. A. Hall and D. B. Shmoys. Near-optimal sequencingwith precedence constraints. In Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference (IPCO1990), pages 249\u2013260. University of Waterloo Press, 1990.","key":"23_CR4"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/moor.17.1.22","volume":"17","author":"L. A. Hall","year":"1992","unstructured":"L. A. Hall and D. B. Shmoys. Jackson\u2019s rule for single-machine scheduling: Making a good heuristic better. MOR: Mathematics of Operations Research, 17:22\u201335, 1992.","journal-title":"MOR: Mathematics of Operations Research"},{"unstructured":"J. R. Jackson. Schedulinga production line to minimize maximum tardiness. Technical Report Research Report 43, Management Science Research Project, UCLA, 1955.","key":"23_CR6"},{"key":"23_CR7","first-page":"25","volume":"30","author":"B. J. Lageweg","year":"1976","unstructured":"B. J. Lageweg, J. K. Lenstra, and A. H. G. R. Kan. Minimizing maximum lateness on one machine: Computational experience and some applications. Statist. Neerlandica, 30:25\u201341, 1976.","journal-title":"Statist"},{"key":"23_CR8","first-page":"343","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"J. K. Lenstra, A. H. G. R. Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Operations Research, 1:343\u2013362, 1977.","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T04:05:26Z","timestamp":1550376326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}