Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling. It represents the most exciting developments in programming languages of the last decade and, not surprisingly, it has recently been identified by the ACM (Association for Computing Machine...

This paper presents the continuous work on a previous project on vision-based hand interaction design. The original work developed a vision-based approach of bare-hand-based posture recognition and motion tracking. This paper further investigates its application in virtual assembly. The accuracy and robustness of the developed approach enable product engineers to perform assembly operations whi...

This paper presents the contimioiis wor/( on a previous project on vision-based hand interaction design. The original worJ< developed a vision-based approach of bare-hand-based posture recognition and motion tracking. This paper further investigates its application in virtual assembly. The accuracy and robustness of the developed approach enable product engineers to perform assembly operations ...

In this paper 3-D models of combined fixture elements are designed, classified by their functions, and saved in computer as supporting elements library, jointing elements library, basic elements library, localization elements library, clamping elements library, and adjusting elements library etc. Then automatic assembly of 3-D combined checking fixture for auto-body part is presented based on m...

This paper focuses on software scheduling in hard real-time embedded systems. It uses the deadlinemonotonic scheduling heuristics, where the analysis whether the hard real-time conditions are met, is done by a schedulability test. The test presented in this paper overcomes the problems of existing approaches with parallel communicating tasks. The essential of the test is, that the communication...

This paper presents a novel mixed-integer programming formulation for scheduling non-preemptive, aperiodic, hard real-time tasks with precedence constraints. It provides an integrated partitioning and scheduling co-synthesis approach. The problem formulation maps some n precedence-related, indivisible jobs having specified processing requirements, release times, and due-dates to a system involv...

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assign...

Hard and soft precedence constraints play a key role in many application domains. In telecommunications, one application is the configuration of callcontrol feature subscriptions where the task is to sequence a set of user-selected features subject to a set of hard (catalogue) precedence constraints and a set of soft (user-selected) precedence constraints. When no such consistent sequence exist...

In 1966, Graham showed that a simple procedure called list scheduling yields a 2-approximation algorithm for the central problem of scheduling precedence constrained jobs on identical machines to minimize makespan. To date this has remained the best algorithm, and whether it can or cannot be improved has become a major open problem in scheduling theory. We address this problem by establishing a...