Author of the publication

Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time.

, , , and . ICINCO-ICSO, page 89-96. INSTICC Press, (2009)

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.

 

Other publications of authors with the same name

Solving the Team Orienteering Problem with Cutting Planes., , and . CoRR, (2016)Exact method for the two-machine flow-shop problem with time delays., , and . Ann. Oper. Res., 298 (1): 375-406 (2021)Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem., and . IJCCI (ICEC), page 77-84. SciTePress, (2010)A variable space search heuristic for the Capacitated Team Orienteering Problem., , and . J. Heuristics, 25 (2): 273-303 (2019)The student scheduling problem at Université de Technologie de Compiègne., , and . Expert Syst. Appl., (2021)GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows., , and . Int. Trans. Oper. Res., 30 (2): 946-969 (2023)An Elitist Non-dominated Heuristic Resolution for the Dynamic Asset Protection Problem., , and . EA, volume 14091 of Lecture Notes in Computer Science, page 201-214. Springer, (2022)Hybrid Heuristic for the Clustered Orienteering Problem., , and . ICCL, volume 10572 of Lecture Notes in Computer Science, page 19-33. Springer, (2017)Optimal Schedules of Coffman-Graham Algorithm for a New Order Class., and . IPDPS, page 138. IEEE Computer Society, (2001)Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem., , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 315-325. Springer, (2004)