Skip to main content

Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling

  • Conference paper
  • First Online:
Operations Research Proceedings 2017

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

Multiprocessor scheduling is a well studied NP-hard optimisation problem that occurs in variety of forms. The focus of this paper is explicit modelling of multiple task intervals. This work extends a constraint generation procedure previously developed for an avionics scheduling context. We here address a relaxation of the original problem and this relaxation can be considered as multiprocessor scheduling with precedence relations and multiple intervals. The explicit modelling of multiple intervals strengthens the formulation used in the constraint generation procedure and we illustrate the computational effects on an industrial relevant avionics scheduling problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.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. Baltz, A., El Ouali, M., Jäger, G., Sauerland, V., & Srivastav, A. (2015). Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection. Journal of the Operational Research Society, 66(4), 615–626.

    Article  Google Scholar 

  2. Blikstad, M., Karlsson, E., Lööw, T., & Rönnberg, E. (2017). An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system. Technical report LiTH-MAT-R–2017/03–SE, Linköping University.

    Google Scholar 

  3. Christiansen, M., & Fagerholt, K. (2002). Robust ship scheduling with multiple time windows. Naval Research Logistics, 49(6), 611–625.

    Article  Google Scholar 

  4. Pesant, G., Gendreau, M., Potvin, J.-Y., & Rousseau, J.-M. (1999). On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem. European Journal of Operational Research, 117(2), 253–263.

    Article  Google Scholar 

Download references

Acknowledgements

The work is part of a project funded by the Center for Industrial Information Technology (CENIIT) and the work of Emil Karlsson is supported by the Research School in Interdisciplinary Mathematics at Linköping University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emil Karlsson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Karlsson, E., Rönnberg, E. (2018). Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_75

Download citation

Publish with us

Policies and ethics