A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Resource-sharing Policy in Multi-tenant Scientific Workflow-as-a-Service Cloud Platform
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
' makespan while meeting a user-defined budget. ...
Our experiments show that the EBPSM algorithm can utilize the resource-sharing policy to achieve higher performance in terms of minimizing the makespan compared to the state-of-the-art budget-constraint ...
Acknowledgments This research is partially supported by LPDP (Indonesia Endowment Fund for Education) and ARC (Australia ...
arXiv:1903.01113v3
fatcat:3ugx3lhdmncz3bf7tmrxny7zce
An adaptive robust optimization model for parallel machine scheduling
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
To that end, we develop the first mixed integer linear programming model for adjustable robust scheduling, and a scalable two-stage approximation heuristic, where we minimize the worst-case makespan. ...
Robust optimization is the natural methodology to cope with the first characteristic of duration uncertainty, yet the existing literature on robust scheduling does not explicitly consider the second characteristic ...
Acknowledgements We are grateful to Michael Pinedo for consultations at the early stage of this work. ...
arXiv:2102.08677v3
fatcat:efxqtktfmfex3d2edt3rt7vzby
Stochastic Load Balancing on Unrelated Machines
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The first is the budgeted makespan minimization problem, where the goal is to minimize the expected makespan subject to scheduling a target number (or reward) of jobs. ...
We extend our main result to obtain a constant-factor approximation algorithm for this problem. ...
This work was done in part while the authors were visiting the Simons Institute for the Theory of Computing. ...
arXiv:1904.07271v1
fatcat:6csknoaehnadnk6glxpzzu3r5a
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In several applications such as databases, planning, and sensor networks, parameters such as selectivity, load, or sensed values are known only with some associated uncertainty. ...
We present general techniques for designing constant factor approximations to the optimal observation schemes for several widely used scheduling and metric objective functions. ...
Acknowledgments: We thank the anonymous referee for significantly improving the presentation of this paper. We also thank Sariel Har-Peled, Ashish Goel and Anupam Gupta for helpful discussions. ...
arXiv:0812.1012v3
fatcat:tzhnbg6l6vawroo52c4jchsxum
Activity couple with interdependent durations: serial, parallel or partly overlapping scheduling
2021
International Journal of Mathematics in Operational Research (IJMOR)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper explores a problem of a hammock (sub-project) with two remaining activities, both eligible for execution. ...
The aim is to determine, in the context of different objective functions and budget constraints, the optimal scheduling of the activities, with the appropriate allocation of budget to the activities. ...
, Varna, Bulgaria,
Acknowledgements The authors would like to thank the editor and the referees for their constructive comments and suggestions that have improved the quality of the paper. 2 ...
doi:10.1504/ijmor.2021.112273
fatcat:whd2prgu2rckjpelpl7wkdtfum
Special Issue on Intelligent Energy Solutions to Sustainable Production and Service Automation
2021
IEEE Transactions on Automation Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We would like to express our sincere thanks to the reviewers for their excellent and timely refereeing. ...
Last, but not least, we thank all authors for their contributions, which made this Special Issue possible. ...
computing budget allocation for minimizing the expected opportunity cost (OCBA EOC). ...
doi:10.1109/tase.2021.3052064
fatcat:apvtkol62zagvk5gali343wyoe
Resilience analysis for project scheduling with renewable resource constraint and uncertain activity durations
2015
Journal of Industrial and Management Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The experimental results suggest that the proposed surrogate measure is more appropriate to indicate resilience than makespan or total free slack. 2010 Mathematics Subject Classification. ...
Traditionally, uncertainty is modelled as either random variables or dynamic events. ...
Thus, we may state that for equilibriums only considering makespan performance, minimization of makespan has stronger relation with resilience, compared with total free slack and SM. ...
doi:10.3934/jimo.2016.12.719
fatcat:qq7gjtbdkbdpjfqwh7urdxh3hu
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The problem was proven NP-hard even for budgeted uncertainty. ...
In the present work we design mixed-integer programming (MIP) formulations that are valid for a variety of uncertainty sets encompassing budgeted uncertainty. ...
Beyond budgeted uncertainty Let us now present results when ∆ is an uncertainty set with several budgets. ...
arXiv:2106.12055v1
fatcat:tlms7id7grd3bkf2cat26yipiy
Makespan and Energy Robust Stochastic Static Resource Allocation of a Bag-of-Tasks to a Heterogeneous Computing System
2015
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Energy-aware resource allocation is one technique a system administrator can employ to address both problems: optimizing the workload completion time (makespan) when given an energy budget, or to minimize ...
We develop and analyze several heuristics for energy-aware resource allocation for both energy-constrained and deadline-constrained problems. ...
Fig. 2 shows the results of the heuristics when maximizing makespan-robustness ( Fig. 2a) with an energy-robustness constraint (Fig. 2b) when varying the energy budget (i.e., varying the difficulty ...
doi:10.1109/tpds.2014.2362921
fatcat:b2lgo46atbdhbjsiw3vvljumfm
Budget-Driven Scheduling of Scientific Workflows in IaaS Clouds with Fine-Grained Billing Periods
2017
ACM Transactions on Autonomous and Adaptive Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The simulation results demonstrate our algorithm's responsiveness to environmental uncertainties and its ability to generate high-quality schedules that comply with the budget constraint while achieving ...
Instead, our work focuses on emerging finer-grained pricing schemes (e.g., per-minute billing) that provide users with more flexibility and the ability to reduce the inherent wastage that results from ...
These results demonstrate once again the efficiency of the makespan-minimizing heuristics used in BAGS. The results for the Montage application are shown in Figure 4 . ...
doi:10.1145/3041036
fatcat:i3axb5426fdbfa54azxmhz3dv4
A Robust Expected Makespan for Permutation Flow Shop Scheduling Depending on Machine Failure Rate
2021
International journal of mathematical, engineering and management sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For solving this problem with consideration to minimizing the expected makespan and maximizing the robustness simultaneously, the well-known (NEH) heuristic is implemented to schedule a set of jobs. ...
The environment of Flow Shop Scheduling Problems (FSSPs) to minimize the makespan of n jobs that have to be performed on m machines is considered. ...
Acknowledgments All authors are very grateful to the University of Mosul-Iraq/College of Computer Sciences and Mathematics and the University of Essex-UK for their support to finish this paper. ...
doi:10.33889/ijmems.2021.6.5.081
fatcat:ffpfjjo77vaz7jsdifohtgf3oe
Modeling the Optimal Maintenance Scheduling Strategy for Bridge Networks
2020
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The results show that the proposed method has an advantage in saving maintenance costs, reducing traffic delays, minimizing makespan compared with two empirical maintenance strategies. ...
An optimal maintenance scheduling strategy for bridge networks can generate an efficient allocation of resources with budget limits and mitigate the perturbations caused by maintenance activities to the ...
For τ < 62%, the results of OMSS keep constant that do not differ with the variation of τ. ...
doi:10.3390/app10020498
fatcat:xnptb752obdajhij7t6oy7eehq
A Fuzzy Logic Controller for Tasks Scheduling Using Unreliable Cloud Resources
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our model minimizes both the makespan and the monetary cost by dynamically selecting reliable or unreliable virtualized resources. ...
., the Uncertainty-Driven Scheduling - UDS algorithm) for the management of scientific workflows in Cloud. ...
THE UNCERTAINTY-DRIVEN SCHEDULING (UDS) ALGORITHM At each time step τ , our algorithm tries to accomplish two goals, i.e., (i) the minimization of the makespan and (ii) the minimization of the monetary ...
arXiv:2009.10515v1
fatcat:xh3i2aqkenbexduyek3cbv4tgy
Proactive project scheduling in an R&D department a bi-objective genetic algorithm
2015
2015 International Conference on Industrial Engineering and Operations Management (IEOM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Phase I of the model provides a systematic approach to assess uncertainty resulting in activity deviation distributions. ...
Results are presented and discussed. ...
they both try to minimize TSAD and makespan. ...
doi:10.1109/ieom.2015.7093733
fatcat:zgbllve57bax5dddrq6vuhdx7u
Exact Lexicographic Scheduling and Approximate Rescheduling
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1805.03437v2 fatcat:heny5dmwyvf4bcrb2a6gb633yyOther Versions
In this context, we investigate the minimum makespan scheduling problem, a.k.a. P||C_max, under uncertainty. ...
We propose a two-stage robust scheduling approach where first-stage decisions are computed with exact lexicographic scheduling and second-stage decisions are derived using approximate rescheduling. ...
For the makespan recovery problem with only job cancellations and processing time reductions (Type 1), in the U(f, k, δ) uncertainty set, Algorithm 3 produces a 2f · (1 + k m−k )-approximate solution and ...
arXiv:1805.03437v3
fatcat:x6f632viijfhrpsireri7ugaim
« Previous
Showing results 1 — 15 out of 406 results