{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:17:18Z","timestamp":1743135438053,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030158422"},{"type":"electronic","value":"9783030158439"}],"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-15843-9_16","type":"book-chapter","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T08:02:38Z","timestamp":1552464158000},"page":"202-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-4116","authenticated-orcid":false,"given":"Rachid","family":"Benmansour","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Braun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2413-7741","authenticated-orcid":false,"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3593-4383","authenticated-orcid":false,"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,14]]},"reference":[{"issue":"3","key":"16_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."},{"doi-asserted-by":"publisher","unstructured":"Benmansour, R., Braun, O., Artiba, A.: On the single-processor scheduling problem with time restrictions. In: 2014 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 242\u2013245. IEEE (2014). https:\/\/doi.org\/10.1109\/CoDIT.2014.6996900","key":"16_CR2","DOI":"10.1109\/CoDIT.2014.6996900"},{"doi-asserted-by":"crossref","unstructured":"Benmansour, R., Braun, O., Artiba, A.: Mixed integer programming formulations for the single processor scheduling problem with time restrictions. In: 45th International Conference on Computers & Industrial Engineering (2015)","key":"16_CR3","DOI":"10.1109\/CoDIT.2014.6996900"},{"doi-asserted-by":"crossref","unstructured":"Benmansour, R., Braun, O., Hamid, A.: Modeling the single-processor scheduling problem with time restrictions as a parallel machine scheduling problem. In: Proceedings MISTA, pp. 325\u2013330 (2015)","key":"16_CR4","DOI":"10.1109\/CoDIT.2014.6996900"},{"doi-asserted-by":"publisher","unstructured":"Benmansour, R., Braun, O., Hanafi, S.: The single processor scheduling problem with time restrictions: complexity and related problems. J. Sched. https:\/\/doi.org\/10.1007\/s10951-018-0579-8","key":"16_CR5","DOI":"10.1007\/s10951-018-0579-8"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10951-013-0342-0","volume":"17","author":"O Braun","year":"2014","unstructured":"Braun, O., Chung, F., Graham, R.: Single-processor scheduling with time restrictions. J. Sched. 17(4), 399\u2013403 (2014)","journal-title":"J. Sched."},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00291-016-0431-5","volume":"38","author":"O Braun","year":"2016","unstructured":"Braun, O., Chung, F., Graham, R.: Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions. OR Spectrum 38(2), 531\u2013540 (2016)","journal-title":"OR Spectrum"},{"issue":"6","key":"16_CR8","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":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","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). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5"},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","volume":"102","author":"NG Hall","year":"2000","unstructured":"Hall, N.G., Potts, C.N., Sriskandarajah, C.: Parallel machine scheduling with a common server. Discrete Appl. Math. 102(3), 223\u2013243 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-1-4614-6940-7_12","volume-title":"Search Methodologies","author":"P Hansen","year":"2014","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies, pp. 313\u2013337. Springer, Boston (2014). https:\/\/doi.org\/10.1007\/978-1-4614-6940-7_12"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"11","key":"16_CR14","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":"7","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","volume":"39","author":"G Kirlik","year":"2012","unstructured":"Kirlik, G., Oguz, C.: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Comput. Oper. Res. 39(7), 1506\u20131520 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","volume":"26","author":"SA Kravchenko","year":"1997","unstructured":"Kravchenko, S.A., Werner, F.: Parallel machine scheduling problems with a single server. Math. Comput. Model. 26(12), 1\u201311 (1997)","journal-title":"Math. Comput. Model."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.cie.2014.11.024","volume":"80","author":"D Lei","year":"2015","unstructured":"Lei, D.: Variable neighborhood search for two-agent flow shop scheduling problem. Comput. Ind. Eng. 80, 125\u2013131 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"16_CR18","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":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107, R., Benmansour, R., Hanafi, S., Mladenovi\u0107, N., Artiba, A.: Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2), 385\u2013396 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s11590-016-1038-0","volume":"11","author":"A Zhang","year":"2017","unstructured":"Zhang, A., Ye, F., Chen, Y., Chen, G.: Better permutations for the single-processor scheduling with time restrictions. Optim. Lett. 11(4), 715\u2013724 (2017)","journal-title":"Optim. Lett."},{"unstructured":"Zhao, L., Xiao, H., Kerbache, L., Hu, Z., Ichoua, S.: A variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery (2014)","key":"16_CR21"}],"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-15843-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T06:02:58Z","timestamp":1574316178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15843-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030158422","9783030158439"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15843-9_16","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":"14 March 2019","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":"Sithonia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vns2018.uom.gr\/","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"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47% - 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"}},{"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"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"14 submissions were accepted for oral presentation only.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}