Advertisement

Abstract

So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(nlog n). This paper proposes O(nlog n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O(nlog n) implementation of fail detection (overload checking).

Keywords

Schedule Problem Time Complexity Constraint Programming Transitive Closure Filter Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    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
  3. 3.
    Brucker, P.: Complex scheduling problems (1999), URL http://citeseer.nj.nec.com/brucker99complex.html
  4. 4.
    Carlier, J., Pinson, E.: Adjustments of head and tails for the job-shop problem. European Journal of Operational Research 78, 146–161 (1994)CrossRefzbMATHGoogle Scholar
  5. 5.
    Caseau, Y., Laburthe, F.: Disjunctive scheduling with task intervals. In: Technical report, LIENS Technical Report 95-25. Ecole Normale Supérieure Paris, Françe (1995)Google Scholar
  6. 6.
    Nuijten, W., Foccaci, F., Laborie, P.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of the 4th International Conference on AI Planning and Scheduling, AIPS 2000, pp. 92–101 (2000)Google Scholar
  7. 7.
    Martin, P., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 389–403. Springer, Heidelberg (1996)Google Scholar
  8. 8.
    Le Pape, C., Baptiste, P., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)zbMATHGoogle Scholar
  9. 9.
    Torres, P., Lopez, P.: On not-first/not-last conditions in disjunctive scheduling. European Journal of Operational Research (1999)Google Scholar
  10. 10.
    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 2002, Gliwice, Poland (2002)Google Scholar
  11. 11.
    Wolf, A.: Pruning while sweeping over task intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Petr Vilím
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPraha 1Czech Republic

Personalised recommendations