Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applications of Declarative Programming and Knowledge Management

Workshop on Logic Programming

INAP 2007, WLP 2007: Applications of Declarative Programming and Knowledge Management pp 21–37Cite as

Linear Weighted-Task-Sum – Scheduling Prioritized Tasks on a Single Resource

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5437))

Abstract

Optimized task scheduling is in general an NP-hard problem, even if the tasks are prioritized like surgeries in hospitals. Better pruning algorithms for the constraints within such constraint optimization problems, in particular for the constraints representing the objectives to be optimized, will result in faster convergence of branch & bound algorithms.

This paper presents new pruning rules for linear weighted (task) sums where the summands are the start times of tasks to be scheduled on an exclusively available resource and weighted by the tasks’ priorities. The presented pruning rules are proven to be correct and the speed-up of the optimization is shown in comparison with well-known general-purpose pruning rules for weighted sums.

The work presented in this paper is funded by the European Union (EFRE) and the state of Berlin within the framework of the research project “inubit MRP”, grant no. 10023515.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Artiouchine, K., Baptiste, P.: Inter-distance constraint: An extension of the all-different constraint for scheduling equal length jobs. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 62–76. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Baptiste, P., le Pape, C., Nuijten, W.: Constraint-Based Scheduling. International Series in Operations Research & Management Science, vol. 39. Kluwer Academic Publishers, Dordrecht (2001)

    Book  MATH  Google Scholar 

  3. Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 377–391. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Beldiceanu, N., Contjean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling 12, 97–123 (1994)

    Article  Google Scholar 

  5. Caseau, Y., Laburthe, F.: Improved CLP scheduling with task intervals. In: van Hentenryck, P. (ed.) Proceedings of the Eleventh International Conference on Logic Programming, ICLP 1994, pp. 369–383. MIT Press, Cambridge (1994)

    Google Scholar 

  6. Hoche, M., Müller, H., Schlenker, H., Wolf, A.: firstcs - A Pure Java Constraint Programming Engine. In: Hanus, M., Hofstedt, P., Wolf, A. (eds.) 2nd International Workshop on Multiparadigm Constraint Programming Languages – MultiCPL 2003, September 29 (2003), uebb.cs.tu-berlin.de/MultiCPL03/Proceedings.MultiCPL03.RCoRP03.pdf

  7. Régin, J.-C., Rueher, M.: A global constraint combining a sum constraint and difference constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 384–395. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space. In: Sφndergaard, H. (ed.) Third International Conference on Principles and Practice of Declarative Programming, Florence, Italy, September 2001, pp. 115–126. ACM Press, New York (2001)

    Google Scholar 

  9. Van Hentenryck, P., le Provost, T.: Incremental search in constraint logic programming. New Generation Computing 9(3&4), 257–275 (1991)

    Article  Google Scholar 

  10. Vilím, P.: O(n logn) filtering algorithms for unary resource constraint. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 335–347. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Vilím, P.: Computing explanations for the unary resource constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 396–409. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Vilím, P., Barták, R., Čepek, O.: Unary Resource Constraint with Optional Activities. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 62–76. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Wolf, A.: Pruning while sweeping over task intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 739–753. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Wolf, A.: Reduce-to-the-opt – A specialized search algorithm for contiguous task scheduling. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS, vol. 3010, pp. 223–232. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Wolf, A.: Better propagation for non-preemptive single-resource constraint problems. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS, vol. 3419, pp. 201–215. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fraunhofer FIRST, Kekuléstr. 7, D-12489, Berlin, Germany

    Armin Wolf

  2. sd&m AG, Kurfürstendamm 22, D-10719, Berlin, Germany

    Gunnar Schrader

Authors
  1. Armin Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gunnar Schrader
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Würzburg, Am Hubland, 97074, Würzburg, Germany

    Dietmar Seipel

  2. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Michael Hanus

  3. Fraunhofer FIRST, Kekuléstr. 7, 12489, Berlin, Germany

    Armin Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolf, A., Schrader, G. (2009). Linear Weighted-Task-Sum – Scheduling Prioritized Tasks on a Single Resource. In: Seipel, D., Hanus, M., Wolf, A. (eds) Applications of Declarative Programming and Knowledge Management. INAP WLP 2007 2007. Lecture Notes in Computer Science(), vol 5437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00675-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00675-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00674-6

  • Online ISBN: 978-3-642-00675-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation