Image de couverture de livre

Scheduling on identical machines with conflicts to minimize the mean flow time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Tellache, Nour ElHouda, Aoudia, Lydia, Boudhar, Mourad
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
par: Tellache, Nour ElHouda, et autres
Publié: (2025)

Aircraft routing: periodicity and complexity
par: Meunier, Frédéric, et autres
Publié: (2025)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
par: Bangerter, Elise, et autres
Publié: (2026)

Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
par: Bozóki, Sándor, et autres
Publié: (2020)

Tree-based formulation for the multi-commodity flow problem
par: Spoorendonk, Simon, et autres
Publié: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
par: Moldenhauer, Carsten, et autres
Publié: (2025)

On the Nucleolus of a Class of Linear Production Games
par: Baïou, Mourad, et autres
Publié: (2022)

Flow Shop Scheduling with Stochastic Reentry
par: von Aspern, Maximilian, et autres
Publié: (2026)

Minimum Cut Representability of Stable Matching Problems
par: Faenza, Yuri, et autres
Publié: (2025)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

A review of minimum cost box searching games
par: Lidbetter, Thomas
Publié: (2025)

On Supportedness in Multi-Objective Combinatorial Optimization
par: Könen, David, et autres
Publié: (2025)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
par: Del Pia, Alberto
Publié: (2025)

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

Projection-width as a structural parameter for discrete separable optimization
par: Del Pia, Alberto
Publié: (2025)

Normalizations of factorizations over convex cones and their effects on extension complexity
par: Brown, Adam, et autres
Publié: (2025)

Extended formulations for the multilinear polytope of acyclic hypergraphs
par: Del Pia, Alberto, et autres
Publié: (2025)

The complete edge relaxation for binary polynomial optimization
par: Del Pia, Alberto, et autres
Publié: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
par: Vercesi, Eleonora, et autres
Publié: (2025)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
par: Besançon, Mathieu
Publié: (2025)

Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
par: Hof, Hugo A., et autres
Publié: (2025)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
par: Nishida, Yuki
Publié: (2025)

Linear Programming Hierarchies Collapse under Symmetry
par: Faenza, Yuri, et autres
Publié: (2025)

A parallel pull labelling algorithm for the resource constrained shortest path problem
par: Petersen, Bjørn, et autres
Publié: (2025)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
par: Thomas, Helen, et autres
Publié: (2025)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
par: Liu, Haoyue, et autres
Publié: (2025)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
par: Villa, Tullio, et autres
Publié: (2025)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
par: Hu, Hins, et autres
Publié: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
par: Alidaee, Bahram, et autres
Publié: (2024)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
par: Proença, Nathan Benedetto, et autres
Publié: (2026)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
par: Wang, Changjun, et autres
Publié: (2026)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
par: Jabbari-Marand, Behnam, et autres
Publié: (2026)

Shortest Paths in Graphs of Convex Sets
par: Marcucci, Tobia, et autres
Publié: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
par: Bernardelli, Ambrogio Maria, et autres
Publié: (2024)

Order acceptance and scheduling in capacitated job shops
par: Linß, Florian, et autres
Publié: (2024)

Market proliferation and the impact of locational complexity on network restructuring
par: Pinar-Pérez, J. M., et autres
Publié: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
par: Swamy, Rahul, et autres
Publié: (2024)

Factorized binary polynomial optimization
par: Del Pia, Alberto
Publié: (2024)