Scheduling Theory Research Papers - Academia.edu (original) (raw)

This paper surveys single-project, single-objective, deterministic project scheduling problems in which activities can be processed using a finite or infinite (and uncountable) number of modes concerning resources of various categories... more

This paper surveys single-project, single-objective, deterministic project scheduling problems in which activities can be processed using a finite or infinite (and uncountable) number of modes concerning resources of various categories and types. The survey is based on a unified framework of a project scheduling model including resources, activities, objectives, and schedules. Most important models and solution approaches across the class

From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling theory has progressed from the artificial constraints and simplistic assumptions used in early work to a sufficient level of maturity that it is... more

From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling theory has progressed from the artificial constraints and simplistic assumptions used in early work to a sufficient level of maturity that it is being increasingly used in the implementation of real-time systems. It is therefore appropriate that within this special issue we provide an historical perspective on the development of fixed priority pre-emptive scheduling.

We present an implementation of the compositional scheduling architecture using Xen virtualization platform. The architecture relies on the existing scheduling theory that uses periodic resource models as component interfaces. We... more

We present an implementation of the compositional scheduling architecture using Xen virtualization platform. The architecture relies on the existing scheduling theory that uses periodic resource models as component interfaces. We implement resource models ...

Abstract. Efficient constructive heuristics have been designed for most of the difficult combinatorial optimisation problems. Performance of these heuristics may vary from one instance to another and hence it is beneficial to be able to... more

Abstract. Efficient constructive heuristics have been designed for most of the difficult combinatorial optimisation problems. Performance of these heuristics may vary from one instance to another and hence it is beneficial to be able to select an instance of the heuristic which is best ...

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two... more

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this

This paper extends the applications of scheduling theory to certain problems in the area of finance. Specifically, a branch and bound algorithm to identify optimal repayment policies for multiple loans (credit purchases) has been... more

This paper extends the applications of scheduling theory to certain problems in the area of finance. Specifically, a branch and bound algorithm to identify optimal repayment policies for multiple loans (credit purchases) has been developed. Each loan qualifies for ...

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in... more

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality” systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to merely two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors we obtain are tight for these two techniques.

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two... more

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's permutations, otherwise it is NP-hard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson's permutations may be used for solving the two-machine job-shop problem with sequence-dependent setup times and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the makespan which are used in a branch-and-bound algorithm. Computational experiments show that an exact solution for this problem may be obtained in a suitable time for n ≤ 280. We al...

Production scheduling represents a major administrative and management issue in modern production planning and control. Ever since the first results of modern scheduling theory appeared some 50 years ago, scheduling research has attracted... more

Production scheduling represents a major administrative and management issue in modern production planning and control. Ever since the first results of modern scheduling theory appeared some 50 years ago, scheduling research has attracted a lot of attention from both academia and industry. The diversity of scheduling problems, the large-scale dimension and dynamic nature of many modern problem-solving environments make this a very complex and difficult research area.

In this paper divisible load scheduling theory is used to examine monetary cost and energy use optimization in a single level tree network. The problem is to flnd an optimal sequence for the distri- bution of the load to each processor... more

In this paper divisible load scheduling theory is used to examine monetary cost and energy use optimization in a single level tree network. The problem is to flnd an optimal sequence for the distri- bution of the load to each processor that will mini- mize the monetary cost or energy consumption of the network. Optimization results from four difierent al-

In this work we study the problem of scheduling tasks with dependencies in multiprocessor architectures where processors have different speeds. We present the preemptive algorithm "Save-Energy" that given a schedule of tasks it post... more

In this work we study the problem of scheduling tasks with dependencies in multiprocessor architectures where processors have different speeds. We present the preemptive algorithm "Save-Energy" that given a schedule of tasks it post processes it to improve the energy efficiency without any deterioration of the makespan. In terms of time efficiency, we show that preemptive scheduling in an asymmetric system can achieve the same or better optimal makespan than in a symmetric system. Motivited by real multiprocessor systems, we investigate architectures that exhibit limited asymmetry: there are two essentially different speeds. Interestingly, this special case has not been studied in the field of parallel computing and scheduling theory; only the general case was studied where processors have KKK essentially different speeds. We present the non-preemptive algorithm ``Remnants'' that achieves almost optimal makespan. We provide a refined analysis of a recent scheduling method. Based on this analysis, we specialize the scheduling policy and provide an algorithm of (3+o(1))(3 + o(1))(3+o(1)) expected approximation factor. Note that this improves the previous best factor (6 for two speeds). We believe that our work will convince researchers to revisit this well studied scheduling problem for these simple, yet realistic, asymmetric multiprocessor architectures.

The controller synthesis paradigm provides a general framework for scheduling real-time applications. Schedulers can be considered as controllers of the applications; they restrict their behavior so that given scheduling requirements are... more

The controller synthesis paradigm provides a general framework for scheduling real-time applications. Schedulers can be considered as controllers of the applications; they restrict their behavior so that given scheduling requirements are met. We study a modeling methodology based on the controller synthesis paradigm. The methodology allows to get a correctly scheduled system from timed models of its processes in an incremental manner, by application of composability results which simplify schedulability analysis. It consists in restricting successively the system to be scheduled by application of constraints defined from scheduling requirements. The latter are a conjunction of schedulability requirements that express timing properties of the processes and policy requirements about resource management. The presented methodology allows a unified view of scheduling theory and approaches based on timing analysis of models of real-time applications.