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
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
