13 research outputs found
Approximation for Scheduling on Parallel Machines with Fixed Jobs or Unavailability Periods
We survey results that address the problem of non-preemptive scheduling on parallel machines with fixed jobs or unavailability periods with the purpose of minimizing the maximum completion time. We consider both identical and uniform processors, and also address the special case of scheduling on nonsimultaneous parallel machines, which may start processing at different times. The discussed results include polynomial-time approximation algorithms that achieve the best possible worst-case approximation bound of 1.5Â in the class of polynomial algorithms unless PÂ =Â NP for scheduling on identical processors with at most one fixed job on each machine and on uniform machines with at most one fixed job on each machine. The presented heuristics have similarities with the LPT algorithm or the MULTIFIT algorithm and they are fast and easy to implement. For scheduling on nonsimultaneous machines, experiments suggest that they would perform well in practice. We also include references to the relevant work in this area that contains more complex algorithms. We then discuss the main methods of argument used in the approximation bound proofs for the simple heuristics, and comment upon current challenges in this area by describing aspects of related practical problems from the automotive industry
Scheduling Problems
Scheduling is defined as the process of assigning operations to resources over time to optimize a criterion. Problems with scheduling comprise both a set of resources and a set of a consumers. As such, managing scheduling problems involves managing the use of resources by several consumers. This book presents some new applications and trends related to task and data scheduling. In particular, chapters focus on data science, big data, high-performance computing, and Cloud computing environments. In addition, this book presents novel algorithms and literature reviews that will guide current and new researchers who work with load balancing, scheduling, and allocation problems
Scheduling on uniform nonsimultaneous parallel machines
Abstract We consider the problem of scheduling on uniform processors which may not start processing at the same time with the purpose of minimizing the maximum completion time. We give a variant of the Multifit algorithm which generates schedules which end within 1.382 times the optimal maximum completion time for the general problem, and within √ 6/2 times the optimal maximum completion time for problem instances with at most two processors. This results from properties of a variant of the Multifit algorithm for scheduling on uniform processors with simultaneous start times. We also show that if a better approximation bound of the Multifit variant for scheduling on uniform processors will be found in the future, this bound will also apply to our Multifit variant for scheduling on nonsimultaneous uniform processors
Optimizing resource allocation in next-generation optical access networks
To meet rapidly increasing traffic demands caused by the popularization of Internet and the spouting of bandwidth-demanding applications, Passive Optical Networks (PONs) exploit the potential capacities of optical fibers, and are becoming promising future-proof access network technologies. On the other hand, for a broader coverage area and higher data rate, integrated optical and wireless access is becoming a future trend for wireless access. This thesis investigates three next-generation access networks: Time Division Multiplexing (TDM) PONs, Wavelength Division Multiplexing (WDM) PONs, and WDM Radio-Over-Fiber (RoF) Picocellular networks.
To address resource allocation problems in these three networks, this thesis first investigates respective characteristics of these networks, and then presents solutions to address respective challenging problems in these networks. In particular, three main problems are addressed: arbitrating time allocation among different applications to guarantee user quality of experience (QoE) in TDM PONs, scheduling wavelengths optimally in WDM PONs, and jointly allocating fiber and radio resources in WDM RoF Picocellular networks. In-depth theoretical analysis and extensive simulations have been performed in evaluating and demonstrating the performances of the proposed schemes
Multiprocessor Scheduling with Availability Constraints
We consider the problem of scheduling a given set of tasks on multiple pro-
cessors with predefined periods of unavailability, with the aim of minimizing the
maximum completion time. Since this problem is strongly NP-hard, polynomial ap-
proximation algorithms are being studied for its solution. Among these, the best
known are LPT (largest processing time first) and Multifit with their variants.
We give a Multifit-based algorithm, FFDL Multifit, which has an optimal worst-
case performance in the class of polynomial algorithms for same-speed processors
with at most two downtimes on each machine, and for uniform processors with at
most one downtime on each machine, assuming that P 6= NP. Our algorithm finishes
within 3/2 the maximum between the end of the last downtime and the end of the
optimal schedule. This bound is asymptotically tight in the class of polynomial
algorithms assuming that P 6= NP. For same-speed processors with at most k
downtimes on each machine our algorithm finishes within ( 3
2 + 1
2k ) the end of the
last downtime or the end of the optimal schedule. For problems where the optimal
schedule ends after the last downtime, and when the downtimes represent fixed jobs,
the maximum completion time of FFDL Multifit is within 3
2 or ( 3
2+ 1
2k ) of the optimal
maximum completion time.
We also give an LPT-based algorithm, LPTX, which matches the performance
of FFDL Multifit for same-speed processors with at most one downtime on each
machine, and is thus optimal in the class of polynomial algorithms for this case.
LPTX differs from LPT in that it uses a specific order of processors to assign tasks if two processors become available at the same time.
For a similar problem, when there is at most one downtime on each machine
and no more than half of the machines are shut down at the same time, we show
that a bound of 2 obtained in a previous work for LPT is asymptotically tight in the
class of polynomial algorithms assuming that P 6= NP
Machine Scheduling Performance with Maintenance and Failure
In manufacturing control, machine scheduling research has mostly dealt with problems either without maintenance or with deterministic maintenance when no failure can occur. This can be unrealistic in practical settings. In this work, an experimental model is developed to evaluate the effect of corrective and preventive maintenance schemes on scheduling performance in the presence of machine failure where the scheduling objective is to minimize schedule duration. We show that neither scheme is clearly superior, but that the applicability of each depends on several system parameters as well as the scheduling environment itself. Further, we show that parameter values can be chosen for which preventive maintenance does better than corrective maintenance. The results provided in this study can be useful to practitioners and to system or machine administrators in manufacturing and elsewhere. (c) 2006 Elsevier Ltd. All rights reserved
Techniques for Proving Approximation Ratios in Scheduling
The problem of finding a schedule with the lowest makespan in the class of all
flowtime-optimal schedules for parallel identical machines is an NP-hard problem. Several approximation algorithms have been suggested for this problem. We focus on algorithms that are fast and easy to implement, rather than on more involved algorithms that might provide tighter approximation bounds. A set of approaches for proving conjectured bounds on performance ratios for such algorithms is outlined. These approaches are used to examine Coffman and Sethi's conjecture for a worst-case bound on the ratio of the makespan of the schedule generated by the LD algorithm to the makespan of the optimal schedule. A significant reduction is achieved in the size of a hypothesised minimal counterexample to this conjecture
Recommended from our members
Shop scheduling with availability constraints
Scheduling Theory studies planning and timetabling of various industrial and human activities and, therefore, is of constant scientific interest. Being a branch of Operational Research, Theory of Scheduling mostly deals with problems of practical interest which can be easily (from a mathematical point of view) solved by full enumeration and at the same time usually require enormous time to be solved optimally. Therefore, one attempts to develop algorithms for finding optimal or near optimal solutions of the problems under consideration in reasonable time. If the output of an algorithm is not always an optimal solution then the worst-case analysis of this algorithm is undertaken in order to estimate either a relative error or an absolute error that holds for any given instance of the problem.
Scheduling problems which are usually considered in the literature assume that the processing facilities are constantly available throughout the planning period. However, in practice, the processing facility, e.g. a machine, a labour, etc. can become non-available due to various reasons, e.g. breakdowns, lunch breaks, holidays, maintenance work, etc. All these facts stimulate research in the area of scheduling with non-availability constraints. This branch of Scheduling Theory has recently received a lot of attention and a considerable number of research papers have been published. This thesis is fully dedicated to scheduling with non-availability constraints under various assumptions on the structure of the processing system and on the types of non-availability intervals