eprintid: 14560
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/01/45/60
datestamp: 2023-11-10 03:29:08
lastmod: 2023-11-10 03:29:08
status_changed: 2023-11-10 01:57:13
type: conference_item
metadata_visibility: show
creators_name: Ngo, S.T.
creators_name: Jaafar, J.
creators_name: Aziz, I.A.
creators_name: Nguyen, G.H.
title: Introduction to A Compromise Programming Based Method for Complex Scheduling and Planning Problems
ispublished: pub
keywords: Combinatorial optimization; Decision making; Evolutionary algorithms; Mathematical programming; Multiobjective optimization, Adaptive methods; Complex scheduling; Compromise programming; Decision makers; Decision-making process; Multi-objectives optimization; Planning problem; Scheduling and planning; Scheduling problem, Scheduling
note: cited By 3; Conference of 4th International Conference on Information Management and Management Science, IMMS 2021 ; Conference Date: 27 August 2021 Through 29 August 2021; Conference Code:175047
abstract: 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. © 2021 ACM. Copyright held by the owner/author(s). Publication rights licensed to ACM.
date: 2021
publisher: Association for Computing Machinery
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85120862833&doi=10.1145%2f3485190.3485231&partnerID=40&md5=41e44699b43835e8d5e9f075c30178a9
id_number: 10.1145/3485190.3485231
full_text_status: none
publication: ACM International Conference Proceeding Series
pagerange: 265-272
refereed: TRUE
isbn: 9781450384278
citation:   Ngo, S.T. and Jaafar, J. and Aziz, I.A. and Nguyen, G.H.  (2021) Introduction to A Compromise Programming Based Method for Complex Scheduling and Planning Problems.  In: UNSPECIFIED.