1 |
A Decision Support System for Advanced Planning and Scheduling in the Plastic Injection IndustryLin, Tzu-Feng 10 July 2003 (has links)
The planning and scheduling requirement of industry can not be satisfied by traditional scheduling systems. Companies need to put extra human resource to fix the result made by these systems. The main reason is an improper assumption of infinite capacity adopted by these scheduling systems. In order to improve the scheduling result, this research refers plastic injection industry¡¦s characters to implement a decision support system.
The decision support system integrates Forward Finite Loading and Constraint Directed into our algorithm in order to minimize the increase in total cost, and raise the capacity balance between machines .According to the result of the practical research, we can prove this decision support system is more effective and efficiency than the traditional scheduling method.
|
2 |
Set Constraints for Local SearchÅgren, Magnus January 2007 (has links)
Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. In this thesis we contribute to simplifying the solving of combinatorial problems using constraint-based local search. To provide higher-level modelling options, we introduce set variables and set constraints in local search by extending relevant local search concepts. We also propose a general scheme to follow in order to define what we call natural and balanced constraint measures, and accordingly define such measures for over a dozen set constraints. However, defining such measures for a new constraint is time-consuming and error-prone. To relieve the user from this, we provide generic measures for any set constraint modelled in monadic existential second-order logic. We also theoretically relate these measures to our proposed general scheme, and discuss implementation issues such as incremental algorithms and their worst-case complexities. To enable higher-level search algorithms, we introduce constraint-directed neighbourhoods in local search by proposing new constraint primitives for representing such neighbourhoods. Based on a constraint, possibly modelled in monadic existential second-order logic, these primitives return neighbourhoods with moves that are known in advance to achieve a decrease (or preservation, or increase) of the constraint measures, without the need to iterate over any other moves. We also present a framework for constraint-based local search where one can model and solve combinatorial problems with set variables and set constraints, use any set constraint modelled in monadic existential second-order logic, as well as use constraint-directed neighbourhoods. Experimental results on three real-life problems show the usefulness in practice of our theoretical results: our running times are comparable to the current state-of-the-art approaches to solving the considered problems.
|
Page generated in 0.1032 seconds