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

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...

Full description

Bibliographic Details
Main Authors: Hamad, Abdelaziz, Sanugi, Bahrom, Salleh, Shaharuddin
Format: Article
Language:English
Published: Faculty of Science, Universiti Teknologi Malaysia 2001
Subjects:
Online Access:http://eprints.utm.my/1754/
http://eprints.utm.my/1754/1/AbdelazizHamad2001_NeuralNetworkforCommonDue.pdf
_version_ 1848890203541864448
author Hamad, Abdelaziz
Sanugi, Bahrom
Salleh, Shaharuddin
author_facet Hamad, Abdelaziz
Sanugi, Bahrom
Salleh, Shaharuddin
author_sort Hamad, Abdelaziz
building UTeM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T20:38:20Z
format Article
id utm-1754
institution Universiti Teknologi Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T20:38:20Z
publishDate 2001
publisher Faculty of Science, Universiti Teknologi Malaysia
recordtype eprints
repository_type Digital Repository
spelling utm-17542010-08-13T02:33:43Z http://eprints.utm.my/1754/ A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines Hamad, Abdelaziz Sanugi, Bahrom Salleh, Shaharuddin QA Mathematics 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. Faculty of Science, Universiti Teknologi Malaysia 2001-12 Article PeerReviewed application/pdf en http://eprints.utm.my/1754/1/AbdelazizHamad2001_NeuralNetworkforCommonDue.pdf 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 http://www.fs.utm.my/matematika/content/view/58/31/
spellingShingle QA Mathematics
Hamad, Abdelaziz
Sanugi, Bahrom
Salleh, Shaharuddin
A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
title A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
title_full A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
title_fullStr A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
title_full_unstemmed A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
title_short A Neural Network for Common Due Date Job Scheduling Problem on Parallel Unrelated Machines
title_sort neural network for common due date job scheduling problem on parallel unrelated machines
topic QA Mathematics
url http://eprints.utm.my/1754/
http://eprints.utm.my/1754/
http://eprints.utm.my/1754/1/AbdelazizHamad2001_NeuralNetworkforCommonDue.pdf