Copertina

Expanding Flow Shop Tasks Based on Recursive Functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kupriyanov, Boris, Lazarev, Alexander, Roschin, Alexandr, Werner, Frank
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 90B35
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Flow shops with reentry: The total weighted completion time objective
di: von Aspern, Maximilian, et al.
Pubblicazione: (2024)

Approximation algorithms for coupled task scheduling minimizing the sum of completion times
di: Fischer, David, et al.
Pubblicazione: (2022)

Tournament schedules and incentives in a double round-robin tournament with four teams
di: Csató, László, et al.
Pubblicazione: (2022)

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

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints
di: Nicosia, Gaia, et al.
Pubblicazione: (2024)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
di: Wessel, Sten, et al.
Pubblicazione: (2025)

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

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

Automating Reformulation for Parallel ADMM
di: Sun, Kaizhao, et al.
Pubblicazione: (2026)

The column number for 3-modular matrices
di: Paat, Joseph, et al.
Pubblicazione: (2025)

Deriving Priorities From Inconsistent PCM using the Network Algorithms
di: Anholcer, Marcin, et al.
Pubblicazione: (2015)

Locational Marginal Pricing of Energy in Pipeline Transport of Natural Gas and Hydrogen with Carbon Offset Incentives
di: Sodwatana, Mo, et al.
Pubblicazione: (2023)

Two Pareto Optimum-based Heuristic Algorithms for Minimizing Tardiness and Late Jobs in the Single Machine Flowshop Problem
di: Gradwohl, Matthew, et al.
Pubblicazione: (2024)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
di: Rothschild, Jacob H.
Pubblicazione: (2024)

Macroscopic Traffic Flow Network Modeling For Wildfire Evacuation: A Game-Theoretic Junction Optimization Approach with Application to Lahaina Fire
di: Lu, Annie, et al.
Pubblicazione: (2026)

Stochastic Finite Volume Method for Uncertainty Management in Gas Pipeline Network Flows
di: Kazi, Saif R., et al.
Pubblicazione: (2024)

Algebraic solution of project scheduling problems with temporal constraints
di: Krivulin, N., et al.
Pubblicazione: (2024)

On the structure of optimal solutions of conservation laws at a junction with one incoming and one outgoing arc
di: Ancona, Fabio, et al.
Pubblicazione: (2025)

Breakdown points of Fermat-Weber problems under gauge distances
di: Comăneci, Andrei, et al.
Pubblicazione: (2023)

An operatorial approach of the well-posedness of an algebraic Riccati equation
di: Marinoschi, Gabriela
Pubblicazione: (2025)

Cuts and semidefinite liftings for the complex cut polytope
di: Sinjorgo, Lennart, et al.
Pubblicazione: (2024)

Minimizing the determinant of the graph Laplacian
di: Albin, Nathan, et al.
Pubblicazione: (2024)

Enhancements of Fragment Based Algorithms for Vehicle Routing Problems
di: Sippel, Lucas, et al.
Pubblicazione: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
di: Xu, Mingming, et al.
Pubblicazione: (2026)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

On exactness of SDP relaxation for the maximum cut problem
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2025)

A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces
di: Sonntag, Konstantin, et al.
Pubblicazione: (2024)

A Comparison of Models for Rolling Stock Scheduling
di: Grimm, Boris, et al.
Pubblicazione: (2023)

A Matheuristic Multi-Start Algorithm for a Novel Static Repositioning Problem in Public Bike-Sharing Systems
di: Daza-Escorcia, Julio-Mario, et al.
Pubblicazione: (2024)

Kinetic description and convergence analysis of genetic algorithms for global optimization
di: Borghi, Giacomo, et al.
Pubblicazione: (2023)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
di: Thürauf, Johannes, et al.
Pubblicazione: (2024)

Distributed Recursion Revisited
di: Zhang, Wei-Yang, et al.
Pubblicazione: (2024)

Uniform-in-time mean-field limit estimate for the Consensus-Based Optimization
di: Huang, Hui, et al.
Pubblicazione: (2024)

Linear complementarity properties of some classes of banded matrices
di: Pratihar, Samapti, et al.
Pubblicazione: (2026)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
di: Teng, Wenshun, et al.
Pubblicazione: (2025)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

Minimum cost network flow with interval capacities: The worst-case scenario
di: Rada, Miroslav, et al.
Pubblicazione: (2026)

Heuristics for the Worst Optimal Value of Interval Transportation Problems
di: Garajová, Elif Radová, et al.
Pubblicazione: (2026)

The true detection probability versus the subjective detection probability of a uniformly optimal search plan
di: Hong, Liang
Pubblicazione: (2026)