Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Negative Total Float to Improve a Multi-Objective Integer Non-Linear Programming for Project Scheduling Compression

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 8 No. 6 (2018)

DOI
10.11591/ijece.v8i6.pp5292-5302
ISSN
2088-8708, 2088-8708
Published
2018-12-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

This paper presents Multi-Objective Integer Non-Linear Programming (MOINLP) involving Negative Total Float (NTF) for improving the basic model of Multi-Objective Programming (MOP) in case the optimization of the additional cost for Project Scheduling Compression (PSC). Using the basic MOP to solve the more complex problems is a challenging task. We suspect that Negative Total Float (NTF) having an indication to make the basic MOP to solve the more general case, both simple and complex of PSC. The purpose of this research is identifying the conflicting objectives in PSC problem using NTF and improving MOINLP by involving the NTF parameter to solve the PSC problem. The Solver Application, which is an add-in of MS Excel, is used to perform optimization process to the model developed. The results show that NTF has an important role to identify the conflicting objectives in PSC. We define NTF is an automatic maximum value of the activity duration reduction to achieve due date of PSC. Furthermore, the use of NTF as a constraint in MOINLP can solve the more general case for both simple and complex PSC problem. Base on the condition, we state that the basic MOP is still significant to solve the PSC complex problems using MOINLP as a sophisticated MOP technique.

Collaboration network of the authors

14 authors · 27 co-authorship links · 3 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Syiah Kuala
  • Universitas Halu Oleo
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Fitri ArniaUniversitas Syiah Kuala2
Khairun SaddamiUniversitas Syiah Kuala2
Khairul MunadiUniversitas Syiah Kuala2
Saiful HusinUniversitas Syiah Kuala2
Zulfikar ZulfikarUniversitas Syiah Kuala1
Rafiqa Shahnaz NoorUniversitas Syiah Kuala1
Roslindah Daeng SiangUniversitas Halu Oleo1
Urbanus DediUniversitas Halu Oleo1
Nurhuda AnnaastasiaUniversitas Halu Oleo1
Risfandi RisfandiUniversitas Halu Oleo1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Negative Total Float to Improve a Multi-Objective Integer Non-Linear Programming for Project Scheduling Compression</dc:title><dc:creator>Fachrurrazi, Fachrurrazi</dc:creator><dc:creator>Abdullah, Abdullah</dc:creator><dc:creator>Away, Yuwaldi</dc:creator><dc:creator>Aulia, Teuku Budi</dc:creator><dc:description>&lt;jats:p&gt;This paper presents Multi-Objective Integer Non-Linear Programming (MOINLP) involving Negative Total Float (NTF) for improving the basic model of Multi-Objective Programming (MOP) in case the optimization of the additional cost for Project Scheduling Compression (PSC). Using the basic MOP to solve the more complex problems is a challenging task. We suspect that Negative Total Float (NTF) having an indication to make the basic MOP to solve the more general case, both simple and complex of PSC. The purpose of this research is identifying the conflicting objectives in PSC problem using NTF and improving MOINLP by involving the NTF parameter to solve the PSC problem. The Solver Application, which is an add-in of MS Excel, is used to perform optimization process to the model developed. The results show that NTF has an important role to identify the conflicting objectives in PSC. We define NTF is an automatic maximum value of the activity duration reduction to achieve due date of PSC. Furthermore, the use of NTF as a constraint in MOINLP can solve the more general case for both simple and complex PSC problem. Base on the condition, we state that the basic MOP is still significant to solve the PSC complex problems using MOINLP as a sophisticated MOP technique.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2018-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v8i6.pp5292-5302</dc:identifier><dc:identifier>10.11591/ijece.v8i6.pp5292-5302</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 8 No 6 (2018); 5292</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/12235/11393</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>