{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:57:23Z","timestamp":1743119843131,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031396977"},{"type":"electronic","value":"9783031396984"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39698-4_10","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T06:02:40Z","timestamp":1692770560000},"page":"139-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1632-884X","authenticated-orcid":false,"given":"Istenc","family":"Tarhan","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Carlier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2482-5042","authenticated-orcid":false,"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9251-249X","authenticated-orcid":false,"given":"Antoine","family":"Jouglet","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2170-6366","authenticated-orcid":false,"given":"Alix","family":"Munier Kordon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-44914-2_9","volume-title":"Discrete Optimization and Operations Research","author":"R van Bevern","year":"2016","unstructured":"van Bevern, R., Bredereck, R., Bulteau, L., Komusiewicz, C., Talmon, N., Woeginger, G.J.: Precedence-constrained scheduling problems parameterized by partial order width. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. Lecture Notes in Computer Science, pp. 105\u2013120. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_9"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Fellows, M.R.: W[2]-hardness of precedence constrained k-processor scheduling. Oper. Res. Lett. 18(2), 93\u201397 (1995). Sep","journal-title":"Oper. Res. Lett."},{"key":"10_CR3","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, Cham (2004)","edition":"4"},{"issue":"1","key":"10_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\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/978-1-4613-0303-9_25","volume-title":"Handbook of Combinatorial Optimization","author":"B Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1493\u20131641. Springer, US, Boston, MA (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_25"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, 1st edn. Springer Publishing Company, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","edition":"1"},{"issue":"12","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E Demeulemeester","year":"1992","unstructured":"Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage. Sci. 38(12), 1803\u20131818 (1992)","journal-title":"Manage. Sci."},{"issue":"11","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","volume":"43","author":"EL Demeulemeester","year":"1997","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: New benchmark results for the resource-constrained project scheduling problem. Manage. Sci. 43(11), 1485\u20131492 (1997)","journal-title":"Manage. Sci."},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, 1st edn. Springer-Verlag, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1","edition":"1"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Hanen, C., Munier Kordon, A.: Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. J. Schedul. (2023). https:\/\/doi.org\/10.1007\/s10951-023-00788-4","DOI":"10.1007\/s10951-023-00788-4"},{"key":"10_CR12","unstructured":"Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. University of California, Technical report (1955)"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"JYT Leung","year":"2004","unstructured":"Leung, J.Y.T.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 1st edn. Chapman & Hall\/CRC, Boca Raton (2004)","edition":"1"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.cor.2018.07.020","volume":"100","author":"M Mnich","year":"2018","unstructured":"Mnich, M., van Bevern, R.: Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100, 254\u2013261 (2018)","journal-title":"Comput. Oper. Res."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2020.11.024","volume":"290","author":"A Munier Kordon","year":"2021","unstructured":"Munier Kordon, A.: A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. Discret. Appl. Math. 290, 1\u20136 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A Sprecher","year":"1995","unstructured":"Sprecher, A., Kolisch, R., Drexl, A.: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 80(1), 94\u2013102 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Tarhan, I., Carlier, J., Hanen, C., Jouglet, A., Munier Kordon, A.: Parametrized analysis of an enumerative algorithm for a parallel machine scheduling problem (2022). (hal-03840284)","DOI":"10.1007\/978-3-031-39698-4_10"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: Np-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2023: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39698-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T15:49:58Z","timestamp":1703000998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39698-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031396977","9783031396984"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39698-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.euro-par.org\/","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":"164","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":"49","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":"30% - 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.98","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}