ILOG SCHEDULE

Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems. It has been argued that the use of constraint-based techniques and tools enables the implementation of precise, flexible efficient and extensible scheduling systems; precise and flexible as the system can take into account any constraint expressible in the constraint language; efficient in as much as highly optimised constraint propagation procedures are now available; extensible as the consideration of a new type of constraint may require (especially in an object-oriented framework) only an extension to the constraint system or, in the worst case, the implementation of additional decision-making modules (without needs for modification of the existing code). The paper presents ILOG SCHEDULE, a C++ library enabling the representation of a wide collection of scheduling constraints in terms of ’resources’ and ’activities’. ILOG SCHEDULE is based on SOLVER, the generic software tool for object-oriented constraint programming from ILOG. SOLVER variables and constraints can be accessed from SCHEDULE activities and resources. As a result, SCHEDULE users can make use of SOLVER to represent specific constraints, and implement and combine the specific problem-solving strategies that are the most appropriate for the scheduling application under consideration. It is hoped-and expected-that object-oriented constraint programming tools like SCHEDULE will enable the industry to make decisive steps toward the implementation of ’state-of-the-art’ highly flexible, constraint-based scheduling applications.


References in zbMATH (referenced in 77 articles )

Showing results 41 to 60 of 77.
Sorted by year (citations)
  1. Lopes, Tony Minoru Tamura; Ciré, Andre Augusto; de Souza, Cid Carvalho; Moura, Arnaldo Vieira: A hybrid model for a multiproduct pipeline planning and scheduling problem (2010) ioport
  2. Pereira Leite, Emilson (ed.): MATLAB -- modelling, programming and simulations. (2010)
  3. Russell, Robert A.; Urban, Timothy L.: The location and allocation of products and product families on retail shelves (2010)
  4. Bidot, Julien; Vidal, Thierry; Laborie, Philippe; Beck, J. Christopher: A theoretic and practical framework for scheduling in a stochastic environment (2009)
  5. Billaut, Jean-Charles; Sourd, Francis: Single machine scheduling with forbidden start times (2009)
  6. Carchrae, Tom; Beck, J. Christopher: Principles for the design of large neighborhood search (2009)
  7. Jouglet, Antoine; Oğuz, Ceyda; Sevaux, Marc: Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (2009)
  8. Laborie, Philippe: IBM ILOG CP optimizer for detailed scheduling illustrated on three problems (2009) ioport
  9. Clautiaux, François; Jouglet, Antoine; Carlier, Jacques; Moukrim, Aziz: A new constraint programming approach for the orthogonal packing problem (2008)
  10. Hamiez, J.-P.; Hao, J.-K.: Using solution properties within an enumerative search to solve a sports league scheduling problem (2008)
  11. Meyer, Bernd: Hybrids of constructive metaheuristics and constraint programming: a case study with ACO (2008)
  12. Rasmussen, Rasmus V.; Trick, Michael A.: Round robin scheduling -- a survey (2008)
  13. Yavuz, Mesut; İnan, Umut H.; Fığlalı, Alpaslan: Fair referee assignments for professional football leagues (2008)
  14. Mercier, Luc; van Hentenryck, Pascal: Strong polynomiality of resource constraint propagation (2007)
  15. Simonis, Helmut: Models for global constraint applications (2007)
  16. Sourd, Francis: Scheduling with periodic availability constraints and irregular cost functions (2007)
  17. Beck, J. Christopher; Prosser, Patrick; Selensky, Evgeny: A case study of mutual routing-scheduling reformulation (2006)
  18. Voudouris, Christos; Owusu, Gilbert; Dorne, Raphael; Ladde, Cedric; Virginas, Botond: ARMS: an automated resource management system for British telecommunications plc (2006)
  19. Sourd, Francis: Optimal timing of a sequence of tasks with general completion costs (2005)
  20. Sourd, Francis: Earliness-tardiness scheduling with setup considerations (2005)