Image de couverture de livre

Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Della Croce, Federico, Schau, Quentin
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

Expanding Flow Shop Tasks Based on Recursive Functions
par: Kupriyanov, Boris, et autres
Publié: (2026)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
par: Nishioka, Akatsuki, et autres
Publié: (2023)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
par: Druetto, Alessandro, et autres
Publié: (2024)

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
par: Fantuzzi, Giovanni, et autres
Publié: (2025)

Algebraic solution of project scheduling problems with temporal constraints
par: Krivulin, N., et autres
Publié: (2024)

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

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
par: Guo, Yu-Qi, et autres
Publié: (2025)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
par: Chen, Wei-Kun, et autres
Publié: (2024)

Rank-one convexification for quadratic optimization problems with step function penalties
par: Choi, Soobin, et autres
Publié: (2025)

Constraint programming model and biased random-key genetic algorithm for the single-machine coupled task scheduling problem with exact delays to minimize the makespan
par: Barbosa, Vítor A., et autres
Publié: (2025)

Distributed Recursion Revisited
par: Zhang, Wei-Yang, et autres
Publié: (2024)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
par: Luo, Fengqiao, et autres
Publié: (2021)

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

An Exact Framework for Solving the Space-Time Dependent TSP
par: Rudich, Isaac, et autres
Publié: (2023)

Tournament schedules and incentives in a double round-robin tournament with four teams
par: Csató, László, et autres
Publié: (2022)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
par: Guigues, Vincent, et autres
Publié: (2017)

An efficient penalty decomposition algorithm for minimization over sparse symmetric sets
par: Mousavi, Ahmad, et autres
Publié: (2026)

A priority-driven constructive heuristic for assigning and scheduling spontaneous volunteers in disaster response
par: Sperling, Martina
Publié: (2026)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
par: Li, Wenjing, et autres
Publié: (2023)

Quasi-Newton methods for minimizing a quadratic function subject to uncertainty
par: Peng, Shen, et autres
Publié: (2021)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
par: Tanınmış, Kübra, et autres
Publié: (2023)

Hub location problems with asymmetric allocation
par: Espejo, I., et autres
Publié: (2026)

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

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
par: Yao, Tongliang, et autres
Publié: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
par: He, Hongjin, et autres
Publié: (2022)

An ILP formulation to optimize flood evacuation paths by minimizing pedestrian speed, length and effort
par: Marinelli, Fabrizio, et autres
Publié: (2025)

Convex quartic problems: homogenized gradient method and preconditioning
par: Dragomir, Radu-Alexandru, et autres
Publié: (2023)

On the solution set of semi-infinite tensor complementarity problem
par: Deb, R., et autres
Publié: (2023)

Derivative-free stochastic bilevel optimization for inverse problems
par: Staudigl, Mathias, et autres
Publié: (2024)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
par: Halbig, Katrin, et autres
Publié: (2024)

A Flow-based Method for Problems with Vanishing Constraints
par: Hansknecht, Christoph, et autres
Publié: (2026)

Presolving and cutting planes for the generalized maximal covering location problem
par: Lv, Wei, et autres
Publié: (2024)

Time-consistency in the mean-variance problem: A new perspective
par: Bäuerle, Nicole, et autres
Publié: (2023)

On feasibility cuts for chance-constrained multicommodity network design problems
par: Wouda, Niels A., et autres
Publié: (2024)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
par: Yang, Yaguang
Publié: (2026)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
par: Halaseh, Sami, et autres
Publié: (2026)

Dantzig-Wolfe and Arc-Flow Reformulations: A Systematic Comparison
par: Yamin, Daniel, et autres
Publié: (2026)