{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:29:35Z","timestamp":1757543375788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030179526"},{"type":"electronic","value":"9783030179533"}],"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-17953-3_7","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:17:39Z","timestamp":1556752659000},"page":"88-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fixed-Order Scheduling on Parallel Machines"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Bosman","sequence":"first","affiliation":[]},{"given":"Dario","family":"Frascaria","sequence":"additional","affiliation":[]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246(2), 345\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J.N., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219\u2013239 (1999)","journal-title":"Omega"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 156\u2013167 (2016)","DOI":"10.1145\/2897518.2897572"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.peva.2005.07.031","volume":"62","author":"H Feng","year":"2005","unstructured":"Feng, H., Misra, V., Rubenstein, D.: Optimal state-free, size-aware dispatching for heterogeneous M\/G\/-type systems. Perform. Eval. 62(1), 475\u2013492 (2005)","journal-title":"Perform. Eval."},{"key":"7_CR6","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Discrete Optimization II. Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"7_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139226424","volume-title":"Performance Modeling and Design of Computer Systems: Queueing Theory in Action","author":"M Harchol-Balter","year":"2013","unstructured":"Harchol-Balter, M.: Performance Modeling and Design of Computer Systems: Queueing Theory in Action, 1st edn. Cambridge University Press, New York (2013)","edition":"1"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jpdc.1999.1577","volume":"59","author":"M Harchol-Balter","year":"1999","unstructured":"Harchol-Balter, M., Crovella, M.E., Murta, C.D.: On choosing a task assignment policy for a distributed server system. IEEE J. Parallel Distrib. Comput. 59(2), 204\u2013228 (1999)","journal-title":"IEEE J. Parallel Distrib. Comput."},{"issue":"7","key":"7_CR10","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K Hiraishi","year":"2002","unstructured":"Hiraishi, K., Levner, E., Vlach, M.: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Comput. Oper. Res. 29(7), 841\u2013848 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15(4), 1119\u20131129 (1986)","journal-title":"SIAM J. Comput."},{"key":"7_CR12","first-page":"7590","volume":"2","author":"EL Lawler","year":"1978","unstructured":"Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 7590 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"5","key":"7_CR13","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1137\/S0097539799358094","volume":"35","author":"M Queyranne","year":"2006","unstructured":"Queyranne, M., Schulz, A.S.: Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM J. Comput. 35(5), 1241\u20131253 (2006)","journal-title":"SIAM J. Comput."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/3-540-45749-6_71","volume-title":"Algorithms \u2014 ESA 2002","author":"Harald R\u00e4cke","year":"2002","unstructured":"R\u00e4cke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: M\u00f6hring, R., Raman, R. (eds.) Proceedings of 10th Annual European Symposium on Algorithms, pp. 820\u2013832 (2002)"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jos.93","volume":"5","author":"AS Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: The power of $$\\alpha $$-points in preemptive single machine scheduling. J. Sched. 5(2), 121\u2013133 (2002)","journal-title":"J. Sched."},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"AS Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM J. Discrete Math. 15(4), 450\u2013469 (2002)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2011.06.007","volume":"39","author":"U Schwiegelshohn","year":"2011","unstructured":"Schwiegelshohn, U.: An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule. Oper. Res. Lett. 39(4), 255\u2013259 (2011)","journal-title":"Oper. Res. Lett."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48, 206\u2013242 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/moor.25.1.63.15212","volume":"25","author":"M Skutella","year":"2000","unstructured":"Skutella, M., Woeginger, G.J.: A PTAS for minimizing the total weighted completion time on identical parallel machines. Math. Oper. Res. 25(1), 63\u201375 (2000)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17953-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:41:43Z","timestamp":1709815303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_7","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":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","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":"113","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":"33","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":"29% - 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":"2.5","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)"}}]}}