Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem

Autor: Margaux Nattaf, Arnaud Malapert

Publikováno v: CP 2020: Principles and Practice of Constraint Programming
CP 2020: Principles and Practice of Constraint Programming, pp.462-477, 2020, ⟨10.1007/978-3-030-58475-7_27⟩
Lecture Notes in Computer Science ISBN: 9783030584740

International audience; This paper studies the scheduling of jobs of different families on parallel machines with qualification constraints. Originating from semiconductor manufacturing, this constraint imposes a time threshold between the execution

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98b761f2dce56e89d803f3008e03fdfe
https://hal.archives-ouvertes.fr/hal-03013857

Estimation of elevator passenger traffic based on the most likely elevator trip origin-destination matrices

Autor: Arnaud Malapert, Juha-Matti Kuusinen

Publikováno v: Building Services Engineering Research and Technology. 38:563-579

We present a constraint programming formulation for the elevator trip origin-destination matrix estimation problem using a lexicographic bi-criteria optimization method where least squares minimization is applied to the measured counts and the minimu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3cb07e5f549834a410eaac9e57b0f631
https://doi.org/10.1177/0143624417707875

A New CP-Approach for a Parallel Machine Scheduling Problem with Time Constraints on Machine Qualifications

Autor: Margaux Nattaf, Arnaud Malapert

Publikováno v: Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030192112
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp.426-442, 2019, ⟨10.1007/978-3-030-19212-9_28⟩

International audience; This paper considers the scheduling of job families on parallel machines with time constraints on machine qualifications. In this problem, each job belongs to a family and a family can only be executed on a subset of qualified

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbce00963838fc60bf7ee2a651df94c2
https://doi.org/10.1007/978-3-030-19212-9_28

Solving the Flight Radius Problem

Autor: Arnaud Malapert, Assia Kamal Idrissi, Rémi Jolin

Publikováno v: Proceedings of the 7th International Conference on Operations Research and Enterprise Systems
7th International Conference on Operations Research and Enterprise Systems (ICORES 2018)
7th International Conference on Operations Research and Enterprise Systems (ICORES 2018), Jan 2018, Funchal, Portugal. pp.304-311, ⟨10.5220/0006654003040311⟩
ICORES

International audience; In this article, we present the flight radius problem on the condensed network. This problem consists of locating in the network what routes represent business opportunities that are attractive regarding time or cost criteria,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1db13ae50e70a365b0b9920e321fc833
https://hal.archives-ouvertes.fr/hal-01701827/file/ICORES2018_KAMALIDRISSI_Assia.pdf

A constraint programming approach for a batch processing problem with non-identical job sizes

Autor: Arnaud Malapert, Louis-Martin Rousseau, Christelle Gueret

Publikováno v: European Journal of Operational Research. 221:533-545

This paper presents a constraint programming approach for a batch processing machine on which a finite number of jobs of non-identical sizes must be scheduled. A parallel batch processing machine can process several jobs simultaneously and the object

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::25e3a3c45bc0c8db9a88266ecc6ae305
https://doi.org/10.1016/j.ejor.2012.04.008