A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems
Article Abstract:
Inductive learning methods from artificial intelligence are used as a decomposition approach to solve optimization problems. The use of these techniques was prompted by the computational inefficiency of traditional optimization algorithms in problems such as those involving scheduling. The method divided a full problem space into smaller exclusive problem spaces. For each sub-space or group of sub-spaces, an evolving algorithm was made. Sub-spaces with simply structured problems used a relatively simple algorithm, while sub-spaces with difficult problems used a more complicated algorithm. This strategy thus increases efficiency and effectiveness.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A computational study of constraint satisfaction for multiple capacitated job shop scheduling
Article Abstract:
The multiple capacitated job shop scheduling problem is shown as a generalization of the job shop scheduling problem where the machines can process several operations at the same time. An algorithm based on constraint satisfaction methods is shown to solve the problem effectively. An empirical performance analysis is made by utilizing a well-known set of instances of the job shop scheduling problem and a newly developed set of instances of the multiple capacitated job shop scheduling problem. Findings reveal that the algorithm works well for both groups of instances.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Hierarchical models for multi-project planning and scheduling
Article Abstract:
A multiobjective model-based procedure for non-expropriating multi-project management problems, generating a heirarchical two-step decomposition of the planning and scheduling activities, is presented. The net present value and the service level are the performance criteria considered. The decomposition of the planning process involves two stages, correlating to a great degree with the strategic and operational levels of analysis.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Efficient solutions for the linear bilevel programming problem. Continuous optimization: suboptimality for multiobjective programming on Banach space
- Abstracts: A multicriteria Pareto-optimal path algorithm. Oriented aligned rectangle packing problem
- Abstracts: VAT and design: rules for conversions. How to win the rating game. Taxing times for architects: architects can enhance their services with a knowledge of how much VAT some projects may incur, and how much can be saved or recouped
- Abstracts: A limited vision of our future. Making the most of thermal mass. Dazed young, professionals stumble blindly, trying to work out what Part 3 is
- Abstracts: The social psychology of project management conflict. On the optimal management of project risk. New computational results for the discrete time/cost tradeoff problem with time-switch constraint