Imagen de Portada

Flow shops with reentry: The total weighted completion time objective

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	von Aspern, Maximilian, Buld, Felix, Klein, Nicklas, Pinedo, Michael
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90B35
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Flow Shop Scheduling with Stochastic Reentry
por: von Aspern, Maximilian, et al.
Publicado: (2026)

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

Expanding Flow Shop Tasks Based on Recursive Functions
por: Kupriyanov, Boris, et al.
Publicado: (2026)

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

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

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

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

Automating Reformulation for Parallel ADMM
por: Sun, Kaizhao, et al.
Publicado: (2026)

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

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

A lexicographically optimal completion for pairwise comparison matrices with missing entries
por: Ágoston, Kolos Csaba, et al.
Publicado: (2022)

On the coincidence of optimal completions for small pairwise comparison matrices with missing entries
por: Csató, László, et al.
Publicado: (2022)

Optimizing a Worldwide-Scale Shipper Transportation Planning in a Carmaker Inbound Supply Chain
por: Brichet, Mathis, et al.
Publicado: (2025)

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

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

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

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

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

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
por: Thomä, Simon, et al.
Publicado: (2022)

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

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

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

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

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

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

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

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

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

A solution procedure for minimizing total completion time in a parallel-batching environment
por: Alfieri, Arianna, et al.
Publicado: (2020)

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

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

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

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

Adaptive Reduced Basis Trust Region Methods for Parabolic Inverse Problems
por: Kartmann, Michael, et al.
Publicado: (2025)

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

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
por: Brandt, Tabea, et al.
Publicado: (2023)

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

A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
por: Tamke, Felix, et al.
Publicado: (2024)

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

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