FROGER, Aurélien; SADYKOV, Ruslan

doi:10.1016/j.ejor.2022.07.012

Metadatos

Licencia de uso del documento

FROGER, Aurélien
Institut de Mathématiques de Bordeaux [IMB]
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

SADYKOV, Ruslan
Formulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]

Idioma

Article de revue

Este ítem está publicado en

European Journal of Operational Research. 2022

Elsevier

Fecha de defensa

2022

Resumen en inglés

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.< Leer menos

Palabras clave en inglés

Iterated local search

Branch-cut-and-price

Labeling algorithm

Sequencing

Scheduling

Metadatos

Compartir este ítem

Licencia de uso del documento

New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources

Idioma

Este ítem está publicado en

Fecha de defensa

Resumen en inglés

Palabras clave en inglés

URI

DOI

Orígen

Centros de investigación