New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE] | |
| dc.contributor.author | FROGER, Aurélien | |
| hal.structure.identifier | Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE] | |
| dc.contributor.author | SADYKOV, Ruslan | |
| dc.date | 2022 | |
| dc.date.accessioned | 2024-04-04T02:40:33Z | |
| dc.date.available | 2024-04-04T02:40:33Z | |
| dc.date.issued | 2022 | |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191071 | |
| dc.description.abstractEn | We study the prize-collecting job sequencing problem with one common and multiple secondary resources. In this problem, a set of jobs is given, each with a profit, multiple time windows for its execution, and a duration during which it requires the main resource. Each job also requires a preassigned secondary resource before, during, and after its use of the main resource. The goal is to select and schedule the subset of jobs that maximize the total profit. We present a new mixed integer linear programming formulation of the problem and a branch-cut-and-price algorithm as an exact solution method. We also introduce a heuristic algorithm to tackle larger instances. Extensive numerical experiments show that our exact algorithm can solve to optimality literature instances with up to 500 jobs for a particular dataset and up to 250 jobs for another dataset with different characteristics. Our heuristic builds high-quality solutions in a small computational time. It computes new best-known solutions for most of the larger instances. | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.rights.uri | http://creativecommons.org/licenses/by/ | |
| dc.subject.en | Iterated local search | |
| dc.subject.en | Branch-cut-and-price | |
| dc.subject.en | Labeling algorithm | |
| dc.subject.en | Sequencing | |
| dc.subject.en | Scheduling | |
| dc.title.en | New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1016/j.ejor.2022.07.012 | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.journal | European Journal of Operational Research | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-03287769 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-03287769v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=European%20Journal%20of%20Operational%20Research&rft.date=2022&rft.eissn=0377-2217&rft.issn=0377-2217&rft.au=FROGER,%20Aur%C3%A9lien&SADYKOV,%20Ruslan&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||