Exact and Local Search Algorithms to Minimize Multicriteria Scheduling Problem
Main Article Content
Abstract
In this article , we consider the Multicriteria scheduling problem on a single machine for minimizing the sum of total completion time (∑Cj) with the total tardiness (∑Tj) and maximum earliness (Emax). We propose a branch and bound (BAB) algorithm to find the optimal solution for the problem. In this BAB algorithm, a lower bound (LB) based on the decomposition property of the Multicriteria problem is used. Two local search algorithms, descent method (DM) and simulated annealing (SA) are applied for the problem. The algorithms DM and SA are compared with the BAB algorithm in order to evaluate effectiveness of the solution methods. Conclusions are formulated on the efficiency of the algorithms, Based on findings of computational experiments.
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.
