{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:46:44Z","timestamp":1742986004659,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250041"},{"type":"electronic","value":"9783030250058"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-25005-8_30","type":"book-chapter","created":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T23:02:23Z","timestamp":1563145343000},"page":"365-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9008-7477","authenticated-orcid":false,"given":"Fumito","family":"Miyake","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1536-1269","authenticated-orcid":false,"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C\u201327","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C\u201327(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"30_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2004","unstructured":"Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24804-0","edition":"4"},{"issue":"8","key":"30_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"1\u20132","key":"30_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0166-218X(98)00143-7","volume":"98","author":"C Chekuri","year":"1999","unstructured":"Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Appl. Math. 98(1\u20132), 29\u201338 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-6377(99)00056-5","volume":"25","author":"FA Chudak","year":"1999","unstructured":"Chudak, F.A., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25(5), 199\u2013204 (1999)","journal-title":"Oper. Res. Lett."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Cir\u00e9, A.A., van Hoeve, W.J.: MDD propagation for disjunctive scheduling. In: Proceedings of the 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012 (2012)","DOI":"10.1609\/icaps.v22i1.13521"},{"issue":"6","key":"30_CR7","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cir\u00e9","year":"2013","unstructured":"Cir\u00e9, A.A., van Hoeve, W.J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411\u20131428 (2013)","journal-title":"Oper. Res."},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-24486-0_22","volume-title":"Algorithmic Learning Theory","author":"T Fujita","year":"2015","unstructured":"Fujita, T., Hatano, K., Kijima, S., Takimoto, E.: Online linear optimization for job scheduling under precedence constraints. In: Chaudhuri, K., Gentile, C., Zilles, S. (eds.) ALT 2015. LNCS (LNAI), vol. 9355, pp. 332\u2013346. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24486-0_22"},{"key":"30_CR9","unstructured":"Gurobi Optimization Inc.: Gurobi optimizer reference manual (2018). http:\/\/www.gurobi.com"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res. 22(3), 513\u2013544 (1997)","journal-title":"Math. Oper. Res."},{"key":"30_CR11","series-title":"Volume 4A, Combinatorial Algorithms, Part 1","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming. Volume 4A, Combinatorial Algorithms, Part 1. Addison-Wesley Professional, Boston (2011)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: On sequencing jobs to minimize weighted completion time subject to precedence constraints (1978)","DOI":"10.1016\/S0167-5060(08)70323-6"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Kan, A.H.G.R.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"issue":"6","key":"30_CR14","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1287\/opre.51.6.981.24912","volume":"51","author":"F Margot","year":"2003","unstructured":"Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows, and a precedence constrained single-machine scheduling problem. Oper. Res. 51(6), 981\u2013992 (2003)","journal-title":"Oper. Res."},{"key":"30_CR15","unstructured":"Matsumoto, K., Hatano, K., Takimoto, E.: Decision diagrams for solving a job scheduling problem under precedence constraints. In: SEA 2018 (2018)"},{"key":"30_CR16","unstructured":"Miller, M.D., Drechsler, R.: Implementing a multiple-valued decision diagram package. In: Proceedings of the 28th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1998, pp. 52\u201357 (1998)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th International Design Automation Conference, DAC 1993, pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"issue":"2","key":"30_CR18","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s100090100038","volume":"3","author":"S Minato","year":"2001","unstructured":"Minato, S.: Zero-suppressed BDDs and their applications. Int. J. Softw. Tools Technol. Transf. 3(2), 156\u2013170 (2001)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"30_CR19","unstructured":"Sakaue, S., Ishihata, M., Minato, S.: Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams. In: Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics (AISTATS 2018). PMLR, vol. 84, pp. 585\u2013594 (2018). http:\/\/proceedings.mlr.press\/v84\/sakaue18a.html"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-61310-2_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"AS Schulz","year":"1996","unstructured":"Schulz, A.S.: Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 301\u2013315. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61310-2_23"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25005-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:15:36Z","timestamp":1710350136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25005-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250041","9783030250058"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25005-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"23 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2019.di.unipi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}