The minimum-cost arborescence problem is a well-studied in the area of graph theory, with known polynomial-time algorithms for solving it. Previous literature introduced new variations on original different objective function and/or constraints. Recently, Precedence-Constrained Minimum-Cost Arborescence was proposed, which precedence constraints are enforced pairs vertices. These prevent format...

A systematic overview on the subject of assembly sequencing is presented. Sequencing lies at the core of assembly planning, and variants include finding a feasible sequence –respecting the precedence constraints between the assembly operations–, or determining an optimal one according to one or several operational criteria. The different ways of representing the space of feasible assembly seque...

Value-based approaches have been used in the real-time scheduling context, especially for so-called anytime applications. Scheduling methodologies for signal processing or similar dataflow-related applications, however, frequently rely on constraint solving techniques like linear programming and on static schemes. For soft and firm real-time applications with precedence constraints and uncertai...

The remote periodic message not only has timing constraints but also often has precedence constrains in Foundation Fieldbus system. In this paper, analysis and heuristic scheduling for remote periodic messages are proposed. Firstly, precedence constrains are considered and described by modifying release times and deadlines of remote periodic messages. Secondly, a heuristic algorithm for buildin...

This paper proposes a Hybrid Genetic Algorithm (HGA) for the Resource Constrained Project Scheduling Problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work employs Genetics Algorithms (GA) and Hybrid Genetic Algorithms to schedule project activities to minimize makespan subject to precedence constraints and resources availability. The algorithms ...

The problem of allocating and scheduling realtime tasks, with Precedence Constraints and Communication Costs, on a multiprocessor architecture in order to meet the timing constraints is known to be NP-complete. Due to the growing complexity of real-time applications there is a need to find scheduling methods that can handle large task sets in a reasonable time. Also, scheduling methods should c...

The paper describes an intelligent ant system-based algorithm for automatic generation of optimal sequence of machining operations required to produce a part, based on minimising the number of tool changes and set-up changes subject to satisfying all precedence constraints during manufacturing. The MATLAB programme for the algorithm uses a list of machining operations, tool approach directions,...

Consider the problem of sequencing n jobs with general precedence constraints on a single machine to minimize total weighted completion time, which is NP-complete. However some class of problems can be solved in polynomial time, i.e .. the problems whose precedence constraints are trees or series parallel. This paper proposes an O(n4) algorithm for implementing a decomposition procedure due to ...