Cover Image

A hybrid harmony search algorithm for the job shop scheduling problems

Machine scheduling is assigning a set of operations of jobs on machines during a time period, taking into account the time, capability, and capacity constraints. In machine scheduling and management science, job shop scheduling is considered as an important problem due to many real-world application...

Full description

Saved in:
Bibliographic Details
Main Authors: Piroozfard, H., Wong, K. Y., Asl, A. D.
Format: Conference or Workshop Item
Published: Institute of Electrical and Electronics Engineers Inc. 2016
Subjects:
HD Industries. Land use. Labor
Online Access:http://eprints.utm.my/id/eprint/73361/
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964845418&doi=10.1109%2fASEA.2015.23&partnerID=40&md5=26e9e5dc596c09dbf6e2ecc302b7feaf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.73361
record_format eprints
spelling my.utm.733612017-11-21T03:28:07Z http://eprints.utm.my/id/eprint/73361/ A hybrid harmony search algorithm for the job shop scheduling problems Piroozfard, H. Wong, K. Y. Asl, A. D. HD Industries. Land use. Labor Machine scheduling is assigning a set of operations of jobs on machines during a time period, taking into account the time, capability, and capacity constraints. In machine scheduling and management science, job shop scheduling is considered as an important problem due to many real-world applications. The job shop scheduling problems are numerically intractable that cannot be solved in polynomial time, unless P = NP, and they are classified as NP-hard. Harmony search algorithm has been successfully implemented in many optimization problems, particularly in scheduling problems, and hybridization is an effective approach for improving the solution quality of the algorithm. This paper proposes an effective hybrid harmony search algorithm for solving the job shop scheduling problems with the objective of minimizing makespan. A set of well-studied benchmarked problems is used to prove the effectiveness and efficiency of the proposed algorithm. The results indicate that the proposed hybrid harmony search algorithm improves the efficiency. Institute of Electrical and Electronics Engineers Inc. 2016 Conference or Workshop Item PeerReviewed Piroozfard, H. and Wong, K. Y. and Asl, A. D. (2016) A hybrid harmony search algorithm for the job shop scheduling problems. In: 8th International Conference on Advanced Software Engineering and Its Applications, ASEA 2015, 25-28 Nov 2015, Jeju Island, South Korea. https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964845418&doi=10.1109%2fASEA.2015.23&partnerID=40&md5=26e9e5dc596c09dbf6e2ecc302b7feaf
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic HD Industries. Land use. Labor
spellingShingle HD Industries. Land use. Labor
Piroozfard, H.
Wong, K. Y.
Asl, A. D.
A hybrid harmony search algorithm for the job shop scheduling problems
description Machine scheduling is assigning a set of operations of jobs on machines during a time period, taking into account the time, capability, and capacity constraints. In machine scheduling and management science, job shop scheduling is considered as an important problem due to many real-world applications. The job shop scheduling problems are numerically intractable that cannot be solved in polynomial time, unless P = NP, and they are classified as NP-hard. Harmony search algorithm has been successfully implemented in many optimization problems, particularly in scheduling problems, and hybridization is an effective approach for improving the solution quality of the algorithm. This paper proposes an effective hybrid harmony search algorithm for solving the job shop scheduling problems with the objective of minimizing makespan. A set of well-studied benchmarked problems is used to prove the effectiveness and efficiency of the proposed algorithm. The results indicate that the proposed hybrid harmony search algorithm improves the efficiency.
format Conference or Workshop Item
author Piroozfard, H.
Wong, K. Y.
Asl, A. D.
author_facet Piroozfard, H.
Wong, K. Y.
Asl, A. D.
author_sort Piroozfard, H.
title A hybrid harmony search algorithm for the job shop scheduling problems
title_short A hybrid harmony search algorithm for the job shop scheduling problems
title_full A hybrid harmony search algorithm for the job shop scheduling problems
title_fullStr A hybrid harmony search algorithm for the job shop scheduling problems
title_full_unstemmed A hybrid harmony search algorithm for the job shop scheduling problems
title_sort hybrid harmony search algorithm for the job shop scheduling problems
publisher Institute of Electrical and Electronics Engineers Inc.
publishDate 2016
url http://eprints.utm.my/id/eprint/73361/
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964845418&doi=10.1109%2fASEA.2015.23&partnerID=40&md5=26e9e5dc596c09dbf6e2ecc302b7feaf
_version_ 1643656641649836032
score 13.211869

Similar Items