Integration of rules and optimization in Plant PowerOps

Autor: Bousonville, T., Focacci, F., Le Pape, C., Nuijten, W.P.M., Paulin, F., Puget, J.F., Robert, A., Sadeghin, A., Barták, R., Milano, M.

Publikováno v: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ISBN: 9783540261520
CPAIOR
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31-June 1, 2005. Proceedings, 1-15
STARTPAGE=1;ENDPAGE=15;TITLE=Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Plant PowerOps (PPO) [9] is a new ILOG product, based on business rules and optimization technology, dedicated to production planning and detailed scheduling for manufacturing. This paper describes how PPO integrates a rule based system with the opti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ad0dee2eb61598ac4a7bc7fb854c26a
https://doi.org/10.1007/11493853_1

Randomized large neighborhood search for cumulative scheduling

Autor: Godard, D., Laborie, P., Nuijten, W.P.M., Biundo, S., Myers, K.L., Rajan, K.

Publikováno v: Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005, Monterey CA, USA, June 5-10, 2005), 81-89
STARTPAGE=81;ENDPAGE=89;TITLE=Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005, Monterey CA, USA, June 5-10, 2005)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::d16d7c3c376db0f601d7ea096050275b
https://research.tue.nl/nl/publications/c2f0dc24-01e1-435b-a0ef-b3b772b46ded

Satisfiability tests and time-bound adjustments for cumulative scheduling problems

Autor: Baptiste, P., Le Pape, C., Nuijten, W.P.M.

Publikováno v: Annals of Operations Research, 92(0), 305-333. Springer

This paper presents a set of satisfiability tests and timebound adjustmentalgorithms that can be applied to cumulative scheduling problems. An instance of thecumulative scheduling problem (CuSP) consists of (1) one resource witha given capacity, and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::8f70f05c51819fd72f2146d88e4426ca
https://research.tue.nl/nl/publications/71a4811c-b1df-400b-bc58-f1443603b3a6

Constraint-based job shop scheduling with ILOG SCHEDULER

Autor: Nuijten, W.P.M., Le Pape, C.

Publikováno v: Journal of Heuristics, 3(4), 271-286. Springer

We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using ILOG SCHEDULER. A new way of calculating lower bounds on the makespan of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::6a1b2f3ee15aad4a19492a782274c7d2
https://research.tue.nl/nl/publications/5389a6f7-76a3-409e-8321-816dc08c4721

Constraint satisfaction for multiple capacitated job shop scheduling

Autor: Nuijten, W.P.M., Aarts, E.H.L., Cohn, A.G.

Publikováno v: Proceedings 11th European Conference in Artificial Intelligence (ECAI'94, Amsterdam, The Netherlands, August 8-12, 1994), 635-639
STARTPAGE=635;ENDPAGE=639;TITLE=Proceedings 11th European Conference in Artificial Intelligence (ECAI'94, Amsterdam, The Netherlands, August 8-12, 1994)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::1835a57a7dd0ebcc11fd839b97124845
https://research.tue.nl/nl/publications/1593093d-a637-443a-a5a1-73e9c95a637e