( en | de | ru )

 

Disambiguation of "Lopez, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Discussion on: 'Solving Transient Scheduling Problems with Constraint Programming' by O. Korbaa, P. Yim, and J.-C. Gentina.

, , , , and . Eur. J. Control, 6 (6): 521-524 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pierre Lopez

Margarita López López

Fátima López López Pielow

Metamorfosis y metáfora: mito y discurso en Pedro Calderón de la Barca y Ovidio. Uni Wuppertal, (2008)

Claudia Carolina López Yomayuza

Charakterisierung der Tollwutvakzinen Rabipur und Rabivac und der enthaltenen Virusstämme FluryLEP und PM 1503. Uni Gießen, (2009)

Caroline López

 

Other publications of authors with the same name

Mixed-integer/linear and constraint programming approaches for activity scheduling in a nuclear research facility., , , and . Int. J. Prod. Res., 58 (23): 7149-7166 (2020)A note on "event-based MILP models for resource-constrained project scheduling problems"., , , , , and . Comput. Oper. Res., 40 (4): 1060-1063 (2013)Event-based MILP models for resource-constrained project scheduling problems., , , and . Comput. Oper. Res., 38 (1): 3-13 (2011)Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search., , , and . Comput. Ind. Eng., 60 (2): 320-327 (2011)Hybrid Methods to Solve the Two-Stage Robust Flexible Job-Shop Scheduling Problem with Budgeted Uncertainty., , and . ICORES, page 135-142. SCITEPRESS, (2023)An Efficient Approach to Data Transfer Scheduling for Long Range Space Exploration., , , , , , and . IJCAI, page 4635-4641. ijcai.org, (2022)The Truck Scheduling Problem at Crossdocking Terminals - Exclusive versus Mixed Mode., , , and . ICORES, page 247-253. SciTePress, (2015)Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine., , and . RAIRO Oper. Res., 33 (2): 185-208 (1999)An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling., , , and . CP, volume 280 of LIPIcs, page 19:1-19:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Characterization of all ρ-approximated sequences for some scheduling problems., and . ETFA, page 1-6. IEEE, (2011)