Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
A bi-criteria algorithm for the simultaneous minimization of makespan and number of tardy jobs on a single machine with sequence dependent set-up time
Scheduling models based on efficient resources utilization without sufficient consideration for customer satisfaction or vice-visa is inadequate in many real-life multi-criteria scheduling problems. This work was aimed at the development of a bi-criteria algorithm for the simultaneous optimization o...
Saved in:
| Format: | Article |
|---|---|
| Published: |
2011
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000njm a2000000a 4500 | ||
|---|---|---|---|
| 001 | oai:repository.ui.edu.ng:123456789/1834 | ||
| 042 | |a dc | ||
| 720 | |a Oladokun, V. O. |e author | ||
| 720 | |a Chalres-Owaba, O. E. |e author | ||
| 720 | |a Olaosebikan, F. O. |e author | ||
| 260 | |c 2011 | ||
| 520 | |a Scheduling models based on efficient resources utilization without sufficient consideration for customer satisfaction or vice-visa is inadequate in many real-life multi-criteria scheduling problems. This work was aimed at the development of a bi-criteria algorithm for the simultaneous optimization of Makespan (Cmax) and Number of tardy jobs (NT) in a single machine problem with Sequence dependent set-up time. An existing single criterion algorithm, the Set Sequencing Algorithm, was adapted to solve the bi-criteria problem, Graphical User Interface (GUI) based software of the new algorithm was developed and its performance was evaluated with a real life problem and 150 randomly generated problems, with problem sizes ranging from between 20 and 150. The values of Crnax and NT of the solution sequences were analysed. The output sequences gave an average reduction of 32.1 0% in both measures of performance compared with the input sequences. The software was also shown to be user friendly. It is concluded that Set sequencing Algorithm is suitable for bi criteria scheduling optimization | ||
| 024 | 8 | |a 2040-7467 | |
| 024 | 8 | |a Research Journal of Applied Science, Engineering and Technology 3(9), pp. 1048-1051 | |
| 024 | 8 | |a ui_art_oladokun_bi-criteria_2011 | |
| 024 | 8 | |a http://ir.library.ui.edu.ng/handle/123456789/1834 | |
| 653 | |a Algorithm, | ||
| 653 | |a machine set-up, | ||
| 653 | |a scheduling, | ||
| 653 | |a set sequencing, | ||
| 653 | |a traveling salesman | ||
| 245 | 0 | 0 | |a A bi-criteria algorithm for the simultaneous minimization of makespan and number of tardy jobs on a single machine with sequence dependent set-up time |