Cover Image

Crane Scheduling Problem with Energy Saving

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gao, Yixiong, Jaehn, Florian, Li, Minming, Ma, Wenhao, Zhang, Xinbo
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Public Event Scheduling with Busy Agents
by: Li, Bo, et al.
Published: (2024)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

Finite Pinwheel Scheduling: the k-Visits Problem
by: Kanellopoulos, Sotiris, et al.
Published: (2025)

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
by: Haas, Niklas, et al.
Published: (2025)

Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
by: Grus, Josef, et al.
Published: (2024)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
by: Sinhal, Anay, et al.
Published: (2026)

Scheduling Problems with Constrained Rejections
by: Davies, Sami, et al.
Published: (2025)

Equivalent Instances for Scheduling and Packing Problems
by: Jansen, Klaus, et al.
Published: (2025)

Energy-Efficient Scheduling with Predictions
by: Balkanski, Eric, et al.
Published: (2024)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
by: Mendoza-Cadena, Mirabel, et al.
Published: (2026)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
by: Hsieh, Yi-Ting, et al.
Published: (2025)

Online Flexible Busy Time Scheduling on Heterogeneous Machines
by: Calinescu, Gruia, et al.
Published: (2024)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
by: Feng, Yiding, et al.
Published: (2026)

New Convex Programming Technique for Nash Social Welfare and Scheduling
by: Feng, Yuda, et al.
Published: (2026)

Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024)

Fixed Order Scheduling with Deadlines
by: Berger, Andre, et al.
Published: (2024)

Optimizing Inventory Placement for a Downstream Online Matching Problem
by: Epstein, Boris, et al.
Published: (2024)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics
by: Jana, Saswata, et al.
Published: (2026)

Non-Clairvoyant Scheduling with Progress Bars
by: Benomar, Ziyad, et al.
Published: (2025)

Online Makespan Scheduling under Scenarios
by: Ergen, Ekin
Published: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2025)

Engineering Optimal Parallel Task Scheduling
by: Akram, Matthew, et al.
Published: (2024)

Scheduling on a Stochastic Number of Machines
by: Buchem, Moritz, et al.
Published: (2024)

ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)

FPTAS for Holant Problems with Log-Concave Signatures
by: He, Kun, et al.
Published: (2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)

Hardness and Approximation Algorithms for Balanced Districting Problems
by: Dharangutte, Prathamesh, et al.
Published: (2025)

Weighted Chairman Assignment and Flow-Time Scheduling
by: Liu, Siyue, et al.
Published: (2025)

Revoke vs. Restart in Unweighted Throughput Scheduling
by: He, Changdao
Published: (2025)

An Empirical Study of Online Packet Scheduling Algorithms
by: Sakr, Nourhan, et al.
Published: (2016)

Root-to-Leaf Scheduling in Write-Optimized Trees
by: Chung, Christopher, et al.
Published: (2024)

Total Completion Time Scheduling Under Scenarios
by: Bosman, Thomas, et al.
Published: (2024)

Online Drone Scheduling for Last-mile Delivery
by: Jana, Saswata, et al.
Published: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
by: Kuszmaul, William, et al.
Published: (2024)

Scheduling two types of jobs with minimum makespan
by: Cao, Song, et al.
Published: (2024)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
by: Ma, Will, et al.
Published: (2019)

LLM Query Scheduling with Prefix Reuse and Latency Constraints
by: Dexter, Gregory, et al.
Published: (2025)