16 Hits in 7.7 sec

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems [article]

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
This paper highlights the state of the art contributions for online scheduling of a sequence of independent jobs on identical and uniform related machines with a special focus on preemptive and non-preemptive  ...  Important competitive analysis results obtained by well-known deterministic and randomized online scheduling algorithms in the literature are presented along with research challenges and open problems.  ...  Acknowledgment This work is partially supported by Department of Computer Science and Engineering of Veer Surendra Sai University of Technology, Burla, Sambalpur, India.  ... 
arXiv:2001.04698v1 fatcat:4pnxnrya6nfvdcuwx5tstljb3m

Semi-online Scheduling: A Survey [article]

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
The survey first introduces the online and semi-online algorithmic frameworks for the multi-processor scheduling problem with important applications and research motivation, followed by a taxonomy for  ...  such as preemptive and non-preemptive with the optimality criteria such as Min-Max and Max-Min.  ...  -Inexact Partial Information.  ... 
arXiv:2005.08614v1 fatcat:o72fqynztrgxziwk46fsqbn5hu

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Tomáš Ebenlendr, Jiří Sgall
2010 Theory of Computing Systems  
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan.  ...  Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.  ...  Tight bounds for preemptive scheduling on 2 uniformly related machines were given in [3] . Inexact partial information.  ... 
doi:10.1007/s00224-010-9287-2 fatcat:peb3foebhvettkpzlua4sg6ybm

Semi-online scheduling problems on two identical machines with inexact partial information

Zhiyi Tan, Yong He
2007 Theoretical Computer Science  
This paper considers semi-online scheduling problems on two identical machines with inexact partial information.  ...  We establish for which r the inexact partial information is useful to improve the performance of a semi-online algorithm with respect to its pure online problem.  ...  Acknowledgements The authors would like to acknowledge an anonymous referee for his careful reading of the paper and helpful comments.  ... 
doi:10.1016/j.tcs.2007.02.014 fatcat:rurgm3l3nraqbhnus7wdw6lciq

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
We propose a divisible load model and give an algorithm for scheduling multilayer divisible computations. The algorithm is tested experimentally.  ...  for the optimization of plants and entire supply chains that are involved in EWO problems.  ...  -Optimal Dynamic Tax Evasion: A Portfolio Approach Francesco Menoncin, Economics, Brescia University, Via S. Faustino, 74/B, 25122, Brescia, Italy,, Rosella Levaggi  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us.  ...  MO4-P-IN201 Preemptive Job-Shop Scheduling Problems with a Fixed Numberof Jobs Brucker Peter J.S.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

OASIcs, Volume 65, ATMOS'18, Complete Volume [article]

Ralf Borndörfer, Sabine Storandt
A.3 Characterization of active and resetting arcs This lemma shows, among other facts, that every arc with a positive queue has to be active.  ...  This work is partially funded by PEDECIBA. Acknowledgements This research was initiated during a research visit of René van Bevern and Oxana Yu. Tsidulko at TU Berlin.  ...  [3] formulated a number of graph problems for the semi-streaming model. Unlike their model, our problem does not allow a pair of nearby agents to swap cells. Vehicular control.  ... 
doi:10.4230/oasics.atmos.2018 fatcat:seasozvzmrfoxe6c2ffkjookhi

Proactive-reactive, robust scheduling and capacity planning of deconstruction projects under uncertainty

Rebekka Volk
For each scenario, a time-optimal project plan (schedule) and deconstruction strategy (sequence) is calculated with multi-modes, and constrained resources and locations onsite (MRCPSP).  ...  Also, a reactive and flexible model element is proposed that can be applied in the case of schedule infeasibility during project execution.  ...  Kronbitter for his assistance.  ... 
doi:10.5445/ksp/1000060265 fatcat:6qiwmdlmpjggbiy4ngqwlkj4ci

Dagstuhl Reports, Volume 6, Issue 10, September 2016, Complete Issue [article]

in the union of n arbitrary theories (including for instance propositional logic), as long as each of them comes with an MCSat-friendly inference system.  ...  Online and Adaptive Methods Markus Wagner University of Adelaide, AU We identify the notion of an MCSat-friendly inference system, and define a generic MCSat calculus that is sound and complete for satisfiability  ...  Selecting the best suited algorithm for an optimization problem is usually a complex and difficult task, especially for expensive Black-Box problems.  ... 
doi:10.4230/dagrep.6.10 fatcat:wq33g6exi5bzll67no5ztodtoy

Results of SEI Line-Funded Exploratory New Starts Projects

Len Bass, Nanette Brown, Gene M Cahill, William Casey, Sagar Chaki, Corey Cohen, Dionisio De Niz, David French, Arie Gurfinkel, Rick Kazman, Edwin J. Morris, Brad Myers (+7 others)
directions for SEI work.  ...  Projects are chosen based on their potential to mature and/or transition software engineering practices, develop information that will help in deciding whether further work is worth funding, and set new  ...  Our results confirmed that we can recover more CPU cycles for non-critical tasks with our scheduler than with the fixed-priority scheduler (using rate-monotonic priorities) without causing problems to  ... 
doi:10.1184/r1/6583433.v1 fatcat:6px2kvwcvvb4jhxlwz7syyrflq

CFE-CMStatistics 2016 PROGRAMME AND ABSTRACTS 10th International Conference on CMStatistics 2016 Programme Committee

Angela Blanco-Fernandez, Gil Gonzalez-Rodriguez, Ana Colubi, Stella Hadjiantoni, M Dolores Jimenez-Gamero, Erricos Kontoghiorghes, George Loizou, Herman Van, Dijk, Peter Boswijk, Jianqing Fang, Alain Hecq (+123 others)
The algorithms are illustrated on selected computation problems in the optimal design of mixture experiments.  ...  The problem is first presented as a special case of a parametric family of optimal design problems for which duality results and optimality conditions are given.  ... 

SECURWARE 2015 Committee SECURWARE Advisory Chairs

Rainer Falk, Hans-Joachim Hof, William Dougherty, Secern Consulting -Charlotte, Hans-Joachim Usa, Hof, Peter Müller, Syed Naqvi, Juha Rőning, Mariusz Jakubowski, Microsoft Research, William Dougherty (+163 others)
We hope that SECURWARE 2015 was a successful international forum for the exchange of ideas and results between academia and industry and for the promotion of progress in emerging security information,  ...  We are grateful to the members of the SECURWARE 2015 organizing committee for their help in handling the logistics and for their work to make this professional meeting a success.  ...  ACKNOWLEDGMENT The authors acknowledge the financial support given to this work, under the project "Security Technologies for Mobile Environments -TSAM", granted by the  ... 

Towards UAV-assisted monitoring of onshore geological CO2 storage site [article]

Florian Poppa, University, The Australian National, University, The Australian National
The robot platform and its autopilot are designed to cope with ongoing sensor developments in addition to providing safety features necessary for the beyond line-of-sight operation of the UAV.  ...  Like other technologies, CCS comes with its risks and rewards.  ...  Furthermore, thanks for the opportunity to tutor your concurrent and distributed systems course, and for providing me Acknowledgements  ... 
doi:10.25911/5d6e501753730 fatcat:hdsvipbninez7ej7rutrrafifm

Software Performance Engineering using Virtual Time Program Execution

Nikolaos Baltas, Anthony Field, Paul Kelly
Our results show that VEX and JINE transparently provide predictions for the response time of unmodified applications with typically good accuracy (within 5-10%) and low simulation overheads (25-50% additional  ...  We explore these ideas using a Virtual EXecution (VEX) framework, which provides performance predictions for multi-threaded applications.  ...  In the prototype implementation of the model integration we solve the problem by implementing a deadlock detection algorithm.  ... 
doi:10.25560/12681 fatcat:6d3voxdc7zfkzpbrhzktv5axgy

The bander's grip

Jenny Isaacs
Using critical theory, archival research at WHSRN headquarters, ethnographic fieldwork, and participant observation embedded with state biologists on the Delaware Bay (WHSRN's flagship site), I argue that  ...  To trace this network, I focus on shorebirds as charismatic "integrative biosentinels" that indicate the health of the global environment and cross-cultural collaboration for shorebird conservation.  ...  SDP is a computer-based, reductive modeling of ecosystems which solves for "optimization problems" using mathematical procedures such as linear programming (Marescot et al., 2013) .  ... 
doi:10.7282/t3-hnd7-3751 fatcat:gqbssg3erfeufdauywfd3dh7fy
« Previous Showing results 1 — 15 out of 16 results