{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:20:51Z","timestamp":1773883251612,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030696245","type":"print"},{"value":"9783030696252","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-69625-2_6","type":"book-chapter","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T00:02:53Z","timestamp":1615766573000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling in Parallel Machines with Two Servers: The Restrictive Case"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-4116","authenticated-orcid":false,"given":"Rachid","family":"Benmansour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5696-7021","authenticated-orcid":false,"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,15]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0305-0548(00)00074-5","volume":"29","author":"AH Abdekhodaee","year":"2002","unstructured":"Abdekhodaee, A.H., Wirth, A.: Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput. Oper. Res. 29(3), 295\u2013315 (2002)","journal-title":"Comput. Oper. Res."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.cor.2018.10.010","volume":"103","author":"G Bektur","year":"2019","unstructured":"Bektur, G., Sara\u00e7, T.: A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput. Oper. Res. 103, 46\u201363 (2019)","journal-title":"Comput. Oper. Res."},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44932-2","volume-title":"Variable neighborhood search","year":"2020","unstructured":"Benmansour, R., Sifaleras, A., Mladenovi\u0107, N. (eds.): Variable neighborhood search. LNCS, vol. 12010. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44932-2"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/jos.120","volume":"5","author":"P Brucker","year":"2002","unstructured":"Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S.A., Werner, F.: Complexity results for parallel machine problems with a single server. J. Sched. 5(6), 429\u2013457 (2002)","journal-title":"J. Sched."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07153-4_9-1","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2016","unstructured":"Duarte, A., Mladenovi\u0107, N., S\u00e1nchez-Oro, J., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Panos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 1\u201327. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_9-1"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-44932-2_8","volume-title":"Variable Neighborhood Search","author":"A Elidrissi","year":"2020","unstructured":"Elidrissi, A., Benbrahim, M., Benmansour, R., Duvivier, D.: Variable neighborhood search for identical parallel machine scheduling problem with a single server. In: Benmansour, R., Sifaleras, A., Mladenovi\u0107, N. (eds.) ICVNS 2019. LNCS, vol. 12010, pp. 112\u2013125. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44932-2_8"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Elidrissi, A., Benmansour, R., Benbrahim, M., Duvivier, D.: MIP formulations for identical parallel machine scheduling problem with single server. In: 2018 4th International Conference on Optimization and Applications (ICOA), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/ICOA.2018.8370596"},{"key":"6_CR8","volume-title":"Handbook of Metaheuristics","author":"FW Glover","year":"2006","unstructured":"Glover, F.W., Kochenberger, G.A.: Handbook of Metaheuristics, vol. 57. Springer, Heidelberg (2006)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010). https:\/\/doi.org\/10.1007\/s10479-009-0657-6","journal-title":"Ann. Oper. Res."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.cor.2013.08.015","volume":"41","author":"K Hasani","year":"2014","unstructured":"Hasani, K., Kravchenko, S.A., Werner, F.: Block models for scheduling jobs on two parallel machines with a single server. Comput. Oper. Res. 41, 94\u201397 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10878-014-9727-z","volume":"30","author":"Y Jiang","year":"2014","unstructured":"Jiang, Y., Zhang, Q., Hu, J., Dong, J., Ji, M.: Single-server parallel-machine scheduling with loading and unloading times. J. Comb. Optim. 30(2), 201\u2013213 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9727-z","journal-title":"J. Comb. Optim."},{"issue":"11","key":"6_CR12","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1016\/j.cor.2011.12.011","volume":"39","author":"MY Kim","year":"2012","unstructured":"Kim, M.Y., Lee, Y.H.: MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. Comput. Oper. Res. 39(11), 2457\u20132468 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1080\/01605682.2018.1500976","volume":"70","author":"GS Liu","year":"2019","unstructured":"Liu, G.S., Li, J.J., Yang, H.D., Huang, G.Q.: Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server. J. Oper. Res. Soc. 70(9), 1554\u20131570 (2019)","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10951-009-0104-1","volume":"13","author":"J Ou","year":"2010","unstructured":"Ou, J., Qi, X., Lee, C.Y.: Parallel machine scheduling with multiple unloading servers. J. Sched. 13(3), 213\u2013226 (2010). https:\/\/doi.org\/10.1007\/s10951-009-0104-1","journal-title":"J. Sched."},{"key":"6_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15843-9","volume-title":"Variable Neighborhood Search","year":"2019","unstructured":"Sifaleras, A., Salhi, S., Brimberg, J. (eds.): Variable Neighborhood Search. LNCS, vol. 11328. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15843-9"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10100-015-0395-6","volume":"24","author":"L Torjai","year":"2016","unstructured":"Torjai, L., Kruzslicz, F.: Mixed integer programming formulations for the biomass truck scheduling problem. CEJOR 24(3), 731\u2013745 (2016). https:\/\/doi.org\/10.1007\/s10100-015-0395-6","journal-title":"CEJOR"},{"issue":"10","key":"6_CR18","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1134\/S0005117910100103","volume":"71","author":"F Werner","year":"2010","unstructured":"Werner, F., Kravchenko, S.A.: Scheduling with multiple servers. Autom. Remote Control 71(10), 2109\u20132121 (2010). https:\/\/doi.org\/10.1134\/S0005117910100103","journal-title":"Autom. Remote Control"}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69625-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T00:14:24Z","timestamp":1615767264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69625-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030696245","9783030696252"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69625-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icvns2020.info\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","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":"13","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":"48% - 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":"2","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":"3","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)"}}]}}