English
Related papers

Related papers: Algorithms for robust production scheduling with e…

200 papers

We consider here the MultiBot problem for the scheduling and the resource parametrization of jobs related to the production or the transportation of different products inside a given time horizon. Those jobs must meet known in advance…

Data Structures and Algorithms · Computer Science 2024-01-02 Pierre Bergé , Mari Chaikovskaia , Jean-Philippe Gayon , Alain Quilliot

Scheduling the power exchange between a population of heterogeneous distributed energy resources and the corresponding upper-level system is an important control problem in power systems. A key challenge is the large number of (partially…

Systems and Control · Electrical Eng. & Systems 2024-09-23 Riccardo Remo Appino , Veit Hagenmeyer , Timm Faulwasser

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline…

Networking and Internet Architecture · Computer Science 2024-09-17 Nicholas Jones , Eytan Modiano

This paper addresses a central challenge of jointly considering shorter-term (e.g. hourly) and longer-term (e.g. yearly) uncertainties in power system planning with increasing penetration of renewable and storage resources. In conventional…

Systems and Control · Electrical Eng. & Systems 2021-09-13 Chao Yan , Xinbo Geng , Zhaohong Bie , Le Xie

We propose a new algorithm for the solution of the robust multiple-load topology optimization problem. The algorithm can be applied to any type of problem, e.g., truss topology, variable thickness sheet or free material optimization. We…

Optimization and Control · Mathematics 2013-07-30 Michal Kocvara

This paper studies scheduling coupled tasks with exact delays to minimize maximum lateness. The first task has processing time $p>0$ and the second $b_i\geq 0$, also the second needs to start exactly $p$ units of time after the completion…

Discrete Mathematics · Computer Science 2026-02-24 Wiesław Kubiak

We study the problem of scheduling jobs on parallel machines minimizing the total completion time, with each job using exactly one resource. First, we derive fundamental properties of the problem and show that the problem is polynomially…

Discrete Mathematics · Computer Science 2018-11-19 T. Janssen , C. Swennenhuis , A. Bitar , T. Bosman , D. Gijswijt , L. van Iersel , S. Dauzére-Pérès , C. Yugma

This paper describes an optimisation methodology that has been specifically developed for engineering design problems. The methodology is based on a Tabu search (TS) algorithm that has been shown to find high quality solutions with a…

Optimization and Control · Mathematics 2016-06-21 Andy M. Connor , P. John Clarkson , Shahrokh Shahpar , Paul Leonard

This paper addresses the robust single machine makespan scheduling with uncertain release dates of the jobs. The release dates take values within know intervals. We use the concept of gamma-robustness in two different settings and address…

Optimization and Control · Mathematics 2020-10-21 Oliver Bachtler , Sven O. Krumke , Huy Minh Le

We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalization lies in simultaneously considering several instances of…

Discrete Mathematics · Computer Science 2021-06-01 Klaus Heeger , Danny Hermelin , George B. Mertzios , Hendrik Molter , Rolf Niedermeier , Dvir Shabtay

We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing…

Data Structures and Algorithms · Computer Science 2014-03-21 Evripidis Bampis , Alexander Kononov , Dimitrios Letsios , Giorgio Lucarelli , Maxim Sviridenko

The stringent power budget of fine grained power managed digital integrated circuits have driven chip designers to optimize power at the cost of area and delay, which were the traditional cost criteria for circuit optimization. The emerging…

Other Computer Science · Computer Science 2013-03-11 Rajdeep Mukherjee , Priyankar Ghosh , Pallab Dasgupta , Ajit Pal

Large data and computing centers consume a significant share of the world's energy consumption. A prominent subset of the workloads in such centers are workflows with interdependent tasks, usually represented as directed acyclic graphs…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-12 Dominik Schweisgut , Anne Benoit , Yves Robert , Henning Meyerhenke

In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose two distinct algorithms. Our first algorithm is an off-line…

Operating Systems · Computer Science 2008-03-10 Vincent Nélis , Joël Goossens , Nicolas Navet , Raymond Devillers , Dragomir Milojevic

We present a scheduler that improves cluster utilization and job completion times by packing tasks having multi-resource requirements and inter-dependencies. While the problem is algorithmically very hard, we achieve near-optimality on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-26 Robert Grandl , Srikanth Kandula , Sriram Rao , Aditya Akella , Janardhan Kulkarni

We consider a distributed computing network consisting of a master and multiple workers processing tasks of different types. The master is running multiple applications. Each application stochastically generates real-time jobs with a strict…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-31 Yu-Pin Hsu , Yu-Chih Huang , Shin-Lin Shieh

In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time between consecutive occurrences of the same edge. This NP-hard…

Data Structures and Algorithms · Computer Science 2024-11-12 Yuriy Biktairov , Leszek Gąsieniec , Wanchote Po Jiamjitrak , Namrata , Benjamin Smith , Sebastian Wild

The scarcity of non-renewable energy sources, geopolitical problems in its supply, increasing prices, and the impact of climate change, force the global economy to develop more energy-efficient solutions for their operations. The…

Artificial Intelligence · Computer Science 2025-10-07 Ahmed Missaoui , Cemalettin Ozturk , Barry O'Sullivan

Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationships have different needs. We formally define and study the…

Data Structures and Algorithms · Computer Science 2024-03-28 Leszek Gąsieniec , Benjamin Smith , Sebastian Wild

Existing research on single-machine scheduling is largely focused on exact algorithms, which perform well on typical instances but can significantly deteriorate on certain regions of the problem space. In contrast, data-driven approaches…

Machine Learning · Computer Science 2025-10-08 Nikolai Antonov , Prěmysl Šůcha , Mikoláš Janota , Jan Hůla