Purpose – In this paper we propose a method for learning robotic assembly sequences, where precedence constraints and object relative size and location constraints can be learned by demonstration and autonomous robot exploration. Design/methodology/approach – In order to successfully plan the operations involved in assembly tasks, the planner needs to know the constraints of the desired task. I...

In the Multiprocessor Scheduling with Precedence Constraints, we are given n-jobs denoted by {J1, J2, · · · , Jn}, the associated processing time pi, i = 1, · · · , n and m identical machines to which jobs are needed to be assigned. In addition, jobs have precedence constraints between them, and we use notation Jj ≺ Ji to imply that Ji cannot be done before completing Jj (the smaller runs earli...

In this paper we present an approach to speciication and veriication of distributed hard real-time systems. By integrating RTL and precedence constraints, we combine the comprehensiveness of precedence graphs with the expressive power and proofability of RTL. Thus, our approach allows easy comprehension by the human designer and formal correctness. We propose to use a static scheduling algorith...

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

In this paper we survey recent results on the precedence constraint single machine scheduling problem to minimize the weighted sum of completion times. We show how we can benefit from known results in dimension theory of partial orders to obtain improved approximate solutions when precedence constraints have low fractional dimension. We believe that dimension theory of partial orders could be o...

the basic type of assembly line balancing (alb) problem is the allocation of work elements to a set of production work stations considering cycle time, precedence constraints, and assembly diagram to achieve predefined performance criteria such as line efficiency and smoothness index. in this paper, a mixed integer programming model for solving multiple product alb problems with processing time...

Determining the precedence of machining features is a critical issue in feature-based process planning. It becomes more complex when geometric interaction occurs between machining features. STEP-NC, the extension of STEP (ISO 10303) standard developed for CNC controllers, is a feature-based data model. It represents all the geometric and topological product data minus feature interactions. In t...

This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the precedence are encoded in (pseudo-)propositional logic and the resulting formula is tested for satisfiability. Any satisfying assignment represents a weight function and a precedence such that the induced Knuth-Bendix order o...