Skip to main content
SpringerLink
Log in

Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11328))

Included in the following conference series:

Abstract

We study the single-processor scheduling problem with time restrictions in order to minimize the makespan. In this problem, n independent jobs have to be processed on a single processor, subject only to the following constraint: During any time period of length \(\alpha >0\) the number of jobs being executed is less than or equal to a given integer value B. It has been shown that the problem is NP-hard even for B = 2. We propose the two metaheuristics variable neighborhood search and a fixed neighborhood search to solve the problem. We conduct computational experiments on randomly generated instances. The results indicate that our algorithms are effective and efficient regarding the quality of the solutions and the computational times required for finding them.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdekhodaee, A.H., Wirth, A.: Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput. Oper. Res. 29(3), 295–315 (2002)

    Article  MathSciNet  Google Scholar 

  2. 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–245. IEEE (2014). https://doi.org/10.1109/CoDIT.2014.6996900

  3. 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)

    Google Scholar 

  4. 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–330 (2015)

    Google Scholar 

  5. 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

  6. Braun, O., Chung, F., Graham, R.: Single-processor scheduling with time restrictions. J. Sched. 17(4), 399–403 (2014)

    Article  MathSciNet  Google Scholar 

  7. 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–540 (2016)

    Article  MathSciNet  Google Scholar 

  8. 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–457 (2002)

    Article  MathSciNet  Google Scholar 

  9. Glover, F.W., Kochenberger, G.A.: Handbook of Metaheuristics, vol. 57. Springer, Heidelberg (2006). https://doi.org/10.1007/978-1-4419-1665-5

    Book  MATH  Google Scholar 

  10. Hall, N.G., Potts, C.N., Sriskandarajah, C.: Parallel machine scheduling with a common server. Discrete Appl. Math. 102(3), 223–243 (2000)

    Article  MathSciNet  Google Scholar 

  11. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MathSciNet  Google Scholar 

  12. Hansen, P., Mladenović, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies, pp. 313–337. Springer, Boston (2014). https://doi.org/10.1007/978-1-4614-6940-7_12

    Chapter  Google Scholar 

  13. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2017)

    Article  MathSciNet  Google Scholar 

  14. 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–2468 (2012)

    Article  MathSciNet  Google Scholar 

  15. 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–1520 (2012)

    Article  MathSciNet  Google Scholar 

  16. Kravchenko, S.A., Werner, F.: Parallel machine scheduling problems with a single server. Math. Comput. Model. 26(12), 1–11 (1997)

    Article  MathSciNet  Google Scholar 

  17. Lei, D.: Variable neighborhood search for two-agent flow shop scheduling problem. Comput. Ind. Eng. 80, 125–131 (2015)

    Article  Google Scholar 

  18. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  19. Todosijević, R., Benmansour, R., Hanafi, S., Mladenović, N., Artiba, A.: Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2), 385–396 (2016)

    Article  MathSciNet  Google Scholar 

  20. Zhang, A., Ye, F., Chen, Y., Chen, G.: Better permutations for the single-processor scheduling with time restrictions. Optim. Lett. 11(4), 715–724 (2017)

    Article  MathSciNet  Google Scholar 

  21. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SI2M Laboratory, Institut National de Statistique et d’Economie Appliquée, Rabat, Morocco

    Rachid Benmansour

  2. Trier University of Applied Sciences, Environmental Campus Birkenfeld, 55761, Birkenfeld, Germany

    Oliver Braun

  3. LAMIH - UMR CNRS 8201, Université Polytechnique des Hauts-de-France, Valenciennes, France

    Rachid Benmansour & Saïd Hanafi

  4. Serbian Academy of Sciences and Arts, Belgrade, Serbia

    Nenad Mladenovic

Authors
  1. Rachid Benmansour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Braun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Saïd Hanafi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nenad Mladenovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rachid Benmansour .

Editor information

Editors and Affiliations

  1. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  2. University of Kent, Canterbury, UK

    Said Salhi

  3. Royal Military College of Canada, Kingston, ON, Canada

    Jack Brimberg

Appendix

Appendix

See Tables 8, 9, 10, 11, 12, 13, 14 and 15.

Table 8. Instances of type N10U10
Full size table
Table 9. Instances of type N10U100
Full size table
Table 10. Instances of type N50U10
Full size table
Table 11. Instances of type N50U100
Full size table
Table 12. Instances of type N100U10
Full size table
Table 13. Instances of type N100U100
Full size table
Table 14. Instances of type N500U10
Full size table
Table 15. Instances of type N500U100
Full size table

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Benmansour, R., Braun, O., Hanafi, S., Mladenovic, N. (2019). Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds) Variable Neighborhood Search. ICVNS 2018. Lecture Notes in Computer Science(), vol 11328. Springer, Cham. https://doi.org/10.1007/978-3-030-15843-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15843-9_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15842-2

  • Online ISBN: 978-3-030-15843-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation