PlumX Metrics
Embed PlumX Metrics

Introduction to A Compromise Programming Based Method for Complex Scheduling and Planning Problems

ACM International Conference Proceeding Series, Page: 265-272
2021
  • 3
    Citations
  • 0
    Usage
  • 7
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

Conference Paper Description

Planning and Planning (SP) plays a vital role in many fields. However, SP problems become more complex when they require to archive multi goals in decision-making processes that are more difficult to solve and push the decision-maker into a dilemma. This paper introduces an adaptive method based on the compromise programming approach to multi-objective optimization (MOP) in scheduling and planning (SP) problems. The proposed method gives an effective integration of mathematical programming with evolutionary algorithms (EA). Through the technique, decision-makers can validate the models as well as evaluate different decision alternatives. The method is in the development progress. However, we have obtained preliminary results by applying the method for solving some SP problems. These results show the feasibility of the proposed method.

Bibliographic Details

Son Tung Ngo; Jafreezal Jaafar; Izzatdin Abdul Aziz; Giang Hoang Nguyen

Association for Computing Machinery (ACM)

Computer Science

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know