Universiti Teknologi Malaysia Institutional Repository

A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines

Hamad, Abdelaziz and Sanugi, Bahrom and Salleh, Shaharuddin (2001) A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines. Matematika, 17 (2). pp. 63-70. ISSN 0127-8274

[img]
Preview
PDF (Full text)
106Kb

Official URL: http://www.fs.utm.my/matematika/content/view/58/31...

Abstract

This paper presents an approach for scheduling under a common due date on parallel unrelated machine problems based on artificial neural network. The objective is to allocate and sequence the jobs on the machines so that the total cost be minimized. This cost is composed of the total earliness and the total tardiness cost. Neural network is a suitable model in our study due to the fact that the problem is NP-hard. In our study, neural network has been proven to be effective and robust in generating near optimal solutions to the problem.

Item Type:Article
Uncontrolled Keywords:Neural networks, unrelated machines, scheduling
Subjects:Q Science > QA Mathematics
Divisions:Science
ID Code:1754
Deposited By: Dr Faridah Mustapha
Deposited On:14 Mar 2007 07:48
Last Modified:13 Aug 2010 02:33

Repository Staff Only: item control page