A Modified Branch and Bound Algorithm for Solving Multi-criteria Sequencing Problem

Main Article Content

Adawiya A. Mohmood Al-Nuaimi, Wasfaa E. Ahmed

Abstract

      To efficiently solve the three criteria (objectives) sequencing problem on a single machine, we propose the modified branch and bound (MBAB) algorithm in this article. The criteria (objectives) are total completion time(∑Cj),total lateness(∑Lj), and maximum tardiness (Tmax) . On a single machine , a collection of n independent tasks (jobs) must be sequenced . Tasks(jobs) j (j=1,2,3,...,n) require processing time pj and require due date dj. Conclusions for the modified branch and bound (MBAB) algorithm are formulated based on  the outcomes of computing tests.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
Adawiya A. Mohmood Al-Nuaimi, Wasfaa E. Ahmed. (2023). A Modified Branch and Bound Algorithm for Solving Multi-criteria Sequencing Problem. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 14(1), 208–218. https://doi.org/10.17762/turcomat.v14i1.13419
Section
Research Articles