{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:30:31Z","timestamp":1726043431508},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304423"},{"type":"electronic","value":"9783030304430"}],"license":[{"start":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T00:00:00Z","timestamp":1567641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-30443-0_17","type":"book-chapter","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T02:13:03Z","timestamp":1567563183000},"page":"188-198","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Single Machine Scheduling with Precedence Constrains, Release and Delivery Times"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Grigoreva","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C Artigues","year":"2008","unstructured":"Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159, 135\u2013159 (2008)","journal-title":"Ann. Oper. Res."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"K Baker","year":"1983","unstructured":"Baker, K., Lawner, E., Lenstra, J., Rinnooy Kan, A.: Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constrains. Oper. Res. 31, 381\u2013386 (1983)","journal-title":"Oper. Res."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/nav.3800210112","volume":"21","author":"K Baker","year":"1974","unstructured":"Baker, K., Su, Z.: Sequensing with due-dates and early start times to minimize maximum tardiness. Naval Res. Logist. Q. 21, 171\u2013176 (1974)","journal-title":"Naval Res. Logist. Q."},{"key":"17_CR4","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Berlin (2007)","edition":"5"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier, J.: The one machine sequencing problem. Eur. J. Oper. Res. 11, 42\u201347 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.omega.2013.02.005","volume":"42","author":"C Chandra","year":"2014","unstructured":"Chandra, C., Liu, Z., He, J., Ruohonen, T.: A binary branch and bound algorithm to minimize maximum scheduling cost. Omega 42, 9\u201315 (2014)","journal-title":"Omega"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","volume":"26","author":"J Grabowski","year":"1986","unstructured":"Grabowski, J., Nowicki, E., Zdrzalka, S.: A block approach for single-mashine scheduling with release dates and due dates. Eur. J. Oper. Res. 26, 278\u2013285 (1986)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"17_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawner, E., Rinnoy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling. A survey. Ann. Discret. Math. 5(10), 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"17_CR9","unstructured":"Grigoreva, N.: Branch and bound method for scheduling precedence constrained tasks on parallel identical processors. In: Proceedings of The World Congress on Engineering 2014, WCE 2014. Lecture Notes in Engineering and Computer Science, pp. 832\u2013836, London, U.K. (2014)"},{"key":"17_CR10","unstructured":"Grigoreva, N.: Branch and bound algorithm for the single machine scheduling problem with release and delivery times. In: 2018 IX International Conference on Optimization and Applications (OPTIMA2018) Supplementory Volume, Petrovac, Montenegro, 1\u20135 October 2018 (2018)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"L Hall","year":"2001","unstructured":"Hall, L., Posner, M.: Generating experimental data forcomputation testing with machine scheduling applications. Oper. Res. 49, 854\u2013865 (2001)","journal-title":"Oper. Res."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J Kanet","year":"2000","unstructured":"Kanet, J., Sridharan, V.: Scheduling with inserted idle time:problem taxonomy and literature review. Oper. Res. 48(1), 99\u2013110 (2000)","journal-title":"Oper. Res."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Ann. Discret. Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discret. Math."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1016\/j.cor.2009.11.008","volume":"37","author":"Z Liu","year":"2010","unstructured":"Liu, Z.: Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints. Comput. Oper. Res. 37, 1537\u20131543 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1287\/opre.23.3.475","volume":"23","author":"G McMahon","year":"1975","unstructured":"McMahon, G., Florian, N.: On scheduling with ready times and due dates to minimize maximum lateness. Oper. Res. 23(3), 475\u2013482 (1975)","journal-title":"Oper. Res."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0166-218X(92)00110-8","volume":"48","author":"E Nowicki","year":"1994","unstructured":"Nowicki, E., Smutnicki, C.: An approximation algorithm for a single-machine scheduling problem with release times and delivery times. Discret. Appl. Math. 48, 69\u201379 (1994)","journal-title":"Discret. Appl. Math."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.ejor.2004.07.050","volume":"168","author":"Y Pan","year":"2006","unstructured":"Pan, Y., Shi, L.: Branch and bound algorithm for solving hard instances of the one-mashine sequencing problem. Eur. J. Oper. Res. 168, 1030\u20131039 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"17_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"C Potts","year":"1980","unstructured":"Potts, C.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res. 28(6), 445\u2013462 (1980)","journal-title":"Oper. Res."},{"key":"17_CR19","unstructured":"Schage, L.: Obtaining optimal solutionto resourse constrained network scheduling problems. Unpublished manuscript (1971)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10951-006-0325-5","volume":"10","author":"K Sourirajan","year":"2007","unstructured":"Sourirajan, K., Uzsoy, R.: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. J. Sched. 10, 41\u201365 (2007)","journal-title":"J. Sched."}],"container-title":["Advances in Intelligent Systems and Computing","Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology \u2013 ISAT 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30443-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T02:18:21Z","timestamp":1567563501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30443-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,5]]},"ISBN":["9783030304423","9783030304430"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30443-0_17","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,9,5]]},"assertion":[{"value":"5 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Systems Architecture and Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isat2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.isat.pwr.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}