Skip to main content
SpringerLink
Log in

Batch Processing with Sequence Dependent Setup Times

  • Conference paper
  • First Online:
Book cover Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2470))

Abstract

Batch processing with sequence dependent setup times is a new extension of the disjunctive scheduling (scheduling on a unary resource). There are several successful filtering algorithms for solving disjunctive scheduling problem in a constraint programming framework. I adapted two of these algorithms (namely edge-finding and not-first/not-last) for the new extended problem and developed other three algorithms (not-before/not-after, precedence-graph-based filtering, sequence composition). Each of these algorithms filters out a different type of inconsistent values so they can be used together to achieve the maximum filtering.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baptiste, P., Le Pape, C.: Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling. In proceedings of the Fifteenth Workshop of the U. K. Planning Special Interest Group (1996)

    Google Scholar 

  2. Vilím, P., Barták, R.: Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. In proceedings of the 6th International Conference on AI Planning and Scheduling, AIPS’02 (2002)

    Google Scholar 

  3. Vilím, P.: Batch Processing with Sequence Dependent Setup Times: New Results. In proceedings of the 4th Workshop of Constraint Programming for Decision and Control, CPDC’02 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 2/25, Praha 1, Czech Republic

    Petr Vilím

Authors
  1. Petr Vilím
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Brown University, Box 1910, Providence, RI, 02912, USA

    Pascal Van Hentenryck

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vilím, P. (2002). Batch Processing with Sequence Dependent Setup Times. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44120-5

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation