A Modified Branch and Bound Algorithm for Solving Multi-criteria Sequencing Problem
Main Article Content
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
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
