Cover Image

Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schau, Quentin, Della Croce, Federico, Ploton, Olivier, t'Kindt, Vincent
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solution of a bilevel optimistic scheduling problem on parallel machines
by: Schau, Quentin, et al.
Published: (2026)

Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
by: Della Croce, Federico, et al.
Published: (2025)

Exact and heuristic methods for the discrete parallel machine scheduling location problem
by: Kramer, Raphael, et al.
Published: (2020)

A bilevel optiization based algorithm for solving a class of price equilibrium problems
by: Hai, Nguyen Ngoc, et al.
Published: (2024)

On incorporating variable consumption functions within energy-efficient parallel machine scheduling
by: Mucciarini, Mirko, et al.
Published: (2024)

No-regret optimization of time-varying bilevel problems
by: Mauduit, Eliabelle, et al.
Published: (2026)

Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems
by: Grange, Camille, et al.
Published: (2024)

Theoretical smoothing frameworks for nonsmooth simple bilevel problems
by: Alcantara, Jan Harold, et al.
Published: (2024)

Approximation and exact penalization in simple bilevel variational problems
by: Bigi, Giancarlo, et al.
Published: (2025)

Forward-backward-forward dynamics for bilevel equilibrium problem
by: Mittal, Kanchan, et al.
Published: (2024)

Directional first order approach for a class of bilevel programs
by: Bai, Kuang, et al.
Published: (2026)

Solving bilevel problems with products of upper- and lower-level variables
by: Hajikazemi, Sina, et al.
Published: (2024)

Proximal gradient descent on the smoothed duality gap to solve saddle point problems
by: Fercoq, Olivier
Published: (2025)

An optimistic planning algorithm for switched discrete-time LQR
by: Granzotto, Mathieu, et al.
Published: (2025)

A bilevel approach for compensation and routing decisions in last-mile delivery
by: Cerulli, Martina, et al.
Published: (2023)

Relaxation methods for pessimistic bilevel optimization
by: Benchouk, Imane, et al.
Published: (2024)

Derivative-free stochastic bilevel optimization for inverse problems
by: Staudigl, Mathias, et al.
Published: (2024)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

A matheuristic approach for an integrated lot-sizing and scheduling problem with a period-based learning effect
by: Rohaninejad, Mohammad, et al.
Published: (2024)

Scholtes relaxation method for pessimistic bilevel optimization
by: Benchouk, Imane, et al.
Published: (2021)

Mitigating optimistic bias in entropic risk estimation and optimization
by: Sadana, Utsav, et al.
Published: (2024)

Proximity-based approximation algorithms for integer bilevel programs
by: Sankaranarayanan, Sriram, et al.
Published: (2024)

The pickup and delivery problem with time windows and scheduling on the edges
by: Barbosa, Vítor A., et al.
Published: (2025)

Linearly convergent bilevel optimization with single-step inner methods
by: Suonperä, Ensio, et al.
Published: (2022)

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

On iteratively regularized first-order methods for simple bilevel optimization
by: Samadi, Sepideh, et al.
Published: (2025)

Single-loop methods for bilevel parameter learning in inverse imaging
by: Suonperä, Ensio, et al.
Published: (2024)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

Geometric and computational hardness of bilevel programming
by: Bolte, Jérôme, et al.
Published: (2024)

Frank-Wolfe meets Shapley-Folkman: a systematic approach for solving nonconvex separable problems with linear constraints
by: Dubois-Taine, Benjamin, et al.
Published: (2024)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
by: Bangerter, Elise, et al.
Published: (2026)

Pessimistic bilevel optimization approach for decision-focused learning
by: Jiménez, Diego, et al.
Published: (2025)

Improved guarantees for optimal Nash equilibrium seeking and bilevel variational inequalities
by: Samadi, Sepideh, et al.
Published: (2023)

Solving bilevel programs based on lower-level Mond-Weir duality
by: Li, Yu-Wei, et al.
Published: (2023)

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
by: Li, Yu-Wei, et al.
Published: (2025)

Exploiting the polyhedral geometry of stochastic linear bilevel programming
by: Muñoz, Gonzalo, et al.
Published: (2022)

An online joint replenishment problem combined with single machine scheduling
by: Györgyi, Péter, et al.
Published: (2022)

Heuristic approaches for a new variant of the Team Orienteering Problem
by: Guastalla, Alberto, et al.
Published: (2025)

A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
by: Chen, Xi, et al.
Published: (2024)

Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
by: Bouška, Michal, et al.
Published: (2024)