|
Abstract
|
Article Information:
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
V.O. Oladokun, O.E. Charles-Owaba and F.O. Olaosebikan
Corresponding Author: Oladokun, Victor Oluwasina
Submitted: 2011 February, 15
Accepted: 2011 March, 21
Published: 2011 September, 20 |
Abstract:
|
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 Cmax and NT of the solution sequences were analysed. The output
sequences gave an average reduction of 32.10% 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.
Key words: Algorithm, machine set-up, scheduling, set sequencing, traveling salesman, ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
V.O. Oladokun, O.E. Charles-Owaba and F.O. Olaosebikan, . 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. Research Journal of Applied Sciences, Engineering and Technology, (09): 1048-1051.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
