Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...

This paper shows an application of constraint logic-based approach to the realistic scheduling problem. Operations scheduling, often influenced by diverse and conflicting constraints, is strongly NP-hard problem of combinatorial optimisation. The problem is complicated further by real scheduling environments, where a variety of constraints in response are critical aspects for the application of...

Function design of embedded real-time system introduced the problem of real-time task scheduling with precedence constraint which needs that scheduling sequence produced by algorithm satisfying not only real-time constraint of every task, but also precedence constraint among tasks. Based on parallel topological sort, this paper presents a new on-line scheduling algorithm OSA-RPC which can set p...

In this paper, an efficient method based on genetic algorithms is developed to solve the multiprocessor scheduling problem. To efficiently execute programs in parallel on multiprocessor scheduling problem must be solved to determine the assignment of tasks to the processors and the execution order of the tasks so that the execution time is minimized. Even when the target processors is fully con...

this paper presented a mixed integer programming for integrated scheduling and process planning. the presented process plan included some orders with precedence relations similar to multiple traveling salesman problem (mtsp), which was categorized as an np-hard problem. these types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

Efficient generation of assembly plans has significant implications on manufacturing costs, however, the underlying mathematical problem is both theoretically and computationally intractable. In the previous paper (Part I), we developed a graph-theoretic framework for the general problem, and we described a constraint satisfaction construct that generates correct assembly precedence graphs give...

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces bounds consistency on this global constraint. We...

Inspired by the popularity of anytime algorithms in solving complex real world problems, we define a class of scheduling problems. In addition to the normal resource constrained project scheduling assumptions, each activity in a project has a quality profile with an anytime property, which means that it can be stopped at any time and the quality of the output is proportional to its duration. In...