Image de couverture de livre

Constraint programming model and biased random-key genetic algorithm for the single-machine coupled task scheduling problem with exact delays to minimize the makespan

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Barbosa, Vítor A., Melo, Rafael A.
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The pickup and delivery problem with time windows and scheduling on the edges
par: Barbosa, Vítor A., et autres
Publié: (2025)

Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
par: Della Croce, Federico, et autres
Publié: (2025)

The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm
par: Silva, Mateus C., et autres
Publié: (2024)

Approximation algorithms for coupled task scheduling minimizing the sum of completion times
par: Fischer, David, et autres
Publié: (2022)

Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
par: Bouška, Michal, et autres
Publié: (2024)

A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem
par: Festa, Paola, et autres
Publié: (2024)

An exact approach for the multi-depot electric vehicle scheduling problem
par: Haslinger, Xenia, et autres
Publié: (2025)

Solution of a bilevel optimistic scheduling problem on parallel machines
par: Schau, Quentin, et autres
Publié: (2026)

PyJobShop: Solving scheduling problems with constraint programming in Python
par: Lan, Leon, et autres
Publié: (2025)

Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop
par: Zorzenon, Davide, et autres
Publié: (2022)

An online joint replenishment problem combined with single machine scheduling
par: Györgyi, Péter, et autres
Publié: (2022)

The colored knapsack problem: structural properties and exact algorithms
par: Ciccarelli, Fabio, et autres
Publié: (2026)

Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
par: Schau, Quentin, et autres
Publié: (2026)

An exact algorithm for vehicle routing problems with temporal dependency constraints
par: van Montfort, Loek, et autres
Publié: (2026)

Solving a linear program via a single unconstrained minimization
par: Otemissov, Adilet, et autres
Publié: (2025)

Sharing delay costs in stochastic scheduling problems with delays
par: Gonçalves-Dosantos, J. C., et autres
Publié: (2024)

Computing an optimal single machine schedule with sequence dependent setup times using shortest path computations
par: Leib, Dominik, et autres
Publié: (2025)

On the tightness of linear relaxations of alternative mixed integer programming formulations for the generator maintenance scheduling problem
par: Andrade, Tiago
Publié: (2025)

Exact and heuristic methods for the discrete parallel machine scheduling location problem
par: Kramer, Raphael, et autres
Publié: (2020)

A unified modeling framework and improved formulations for single-hoist cyclic scheduling
par: Horváth, Markó
Publié: (2026)

Appointment scheduling model in healthcare using clustering algorithms
par: Yousefi, Niloofar, et autres
Publié: (2019)

A stochastic integer programming approach to reserve staff scheduling with preferences
par: Perreault-Lafleur, Carl, et autres
Publié: (2022)

Real-time optimal delay minimization algorithms for aircraft on a same runway and dual runways
par: Lin, Peng, et autres
Publié: (2026)

Adaptive sieving with semismooth Newton proximal augmented Lagrangian algorithm for multi-task Lasso problems
par: Lin, Lanyu, et autres
Publié: (2025)

A combinatorial approach to Ramana's exact dual for semidefinite programming
par: Pataki, Gabor
Publié: (2025)

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
par: Nishijima, Mitsuhiro, et autres
Publié: (2025)

Uncertain random geometric programming problems
par: Mondal, Tapas, et autres
Publié: (2023)

On incorporating variable consumption functions within energy-efficient parallel machine scheduling
par: Mucciarini, Mirko, et autres
Publié: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
par: Ales, Zacharie, et autres
Publié: (2024)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
par: Li, Shuyao, et autres
Publié: (2023)

Efficient exact sequential lifting algorithm for binary knapsack set
par: Wang, Xintong, et autres
Publié: (2026)

An exact column generation algorithm for load balancing in capacity sharing networks
par: Hu, Kaixiang, et autres
Publié: (2024)

Chance-constrained battery management strategies for the electric bus scheduling problem
par: Ricard, Léa, et autres
Publié: (2025)

A proximal algorithm incorporating difference of convex functions optimization for solving a class of single-ratio fractional programming
par: Qi, Anna, et autres
Publié: (2025)

An exact pricing algorithm for revenue maximization under the logit demand function
par: Nayeem, Moddassir Khan, et autres
Publié: (2025)

An iterative Constraint Programming approach to integrate maximum workload constraints in preemptive jobshop scheduling
par: Terrien, Tanguy, et autres
Publié: (2026)

Neural network model for mathematical programming problems with complementary constraints
par: Jayswal, Anurag, et autres
Publié: (2026)

Approximation and exact penalization in simple bilevel variational problems
par: Bigi, Giancarlo, et autres
Publié: (2025)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
par: Bai, Yikun
Publié: (2024)

A strongly polynomial-time algorithm for the general linear programming problem
par: Awoniyi, Samuel
Publié: (2025)