A single machine scheduling problem with a given partial order of jobs is considered. There are subsets of jobs called courses. It is necessary to schedule jobs in such a way that the total weighted duration of all courses is minimal. We consider ...

This paper models and solves the scheduling problem of cable manufacturing industries that minimizes the total production cost, including processing, setup, and storing costs. Two hybrid meta-heuristics, which combine simulated annealing and variable ...

An efficient method for solving the classical NP-hard problem of scheduling theory for one device—the problem of minimizing the total delay —is presented. An algorithm for solving the problem is proposed based on the decomposition of the original ...

We consider the recursive conveyor schedule optimization problem. To this end, we introduce the definition of a conveyor described by a connected acyclic graph, in which each vertex is an operation or a control function associated with the ...

The paper is based on using methods of continuous mathematics in discrete problems. Three new approaches to solving scheduling theory problems are considered, namely, a metric approach, an interpolation approach, and a combined one (metric ...

The problem of scheduling optimally a given set of jobs on a single machine is studied. The lower and upper bounds on the admissible duration of each job are known. The optimality criterion of the schedule is the minimum total completion time of a ...

The efficiency of a recursive conveyor is conceptually formalized, and the optimal allocation of renewable resources is obtained by maximizing efficiency via reduction to an integer linear programming problem. The recursive functions for ...

The specificity of concrete products (CP) plants planning and scheduling is discussed. Design concepts of work schedules for such facilities are examined. Operation principles of scheduling algorithms are described.

The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for ...

Current adaptive mixed criticality scheduling policies assume a high criticality mode in which all low criticality tasks are descheduled to ensure that high criticality tasks can meet timing constraints derived from certification approved methods. In ...

Solving JSSP is an intractable subject. It has great significance in improving productive efficiencies for manufacture enterprise. In recent decades, designing algorithms for solving problem of JSSP problem become an important issue. Moreover, it is ...

Real-time systems are often modeled as a collection of tasks, describing the structure of the processor's workload. In the literature, task-models of different expressiveness have been developed, ranging from the traditional periodic task model to ...

In this paper we study a scheduling problem with moldable and non-moldable parallel tasks on $m$ processors. A non-moldable parallel task is one that runs in parallel on a specific given number of processors. The goal is to find a non-preemptive ...

In cluster computing, a service provider must allocate necessary computing resources for large-scale scientific computations to process a customer's service request according to a service level agreement (SLA) that is a set of quality of services (QoS) ...

The paper describes an optimization procedure for a class of discrete optimization problems which is defined by certain properties of the boundary of the feasible region and level sets of the objective function. It is shown that these properties are ...

Cluster computing is excellent for parallel computation. It has become increasingly popular. In cluster computing, a service level agreement (SLA) is a set of quality of services (QoS) and a fee agreed between a customer and an application service ...

A single machine scheduling problem involving fuzzy time delays and fuzzy precedence constraints is analyzed. Schedules are evaluated not only by degree of satisfaction with fuzzy time delays but also degrees of satisfaction with fuzzy precedence ...

A single machine scheduling problem involving fuzzy time delays and fuzzy precedence constraints is analyzed. Schedules are evaluated not only by degree of satisfaction with fuzzy time delays but also degrees of satisfaction with fuzzy precedence ...

Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order to overcome these difficulties, by allowing processors to be fractionally ...

We present a framework for designing schedulers for hard real-time systems upon uniform multiprocessors based on Supervisory Control Theory (SCT) for timed discrete-event systems (TDES). The contribution of this work lies in the development of a formal ...