AUB ScholarWorks

A hybrid searching method for the unrelated parallel machine scheduling problem

Show simple item record

dc.contributor.author Charalambous C.
dc.contributor.author Fleszar K.
dc.contributor.author Hindi K.S.
dc.contributor.editor
dc.date 2010
dc.date.accessioned 2017-09-07T07:51:22Z
dc.date.available 2017-09-07T07:51:22Z
dc.date.issued 2010
dc.identifier 10.1007/978-3-642-16239-8_31
dc.identifier.isbn 364216238X
dc.identifier.isbn 9783642162381
dc.identifier.issn 18684238
dc.identifier.uri http://hdl.handle.net/10938/12110
dc.description.abstract The work addresses the NP-hard problem of scheduling a set of jobs to unrelated parallel machines with the overall objective of minimizing makespan. The solution presented proposes a greedy constructive algorithm followed by an application of a Variable Neighborhood Decent strategy that continually improves the incumbent solution until a local optimum is reached. The strength of the approach lies in the adoption of different objectives at various stages of the search to avoid early local optimum entrapment and, mainly, in the hybridization of heuristic methods and mathematical programming for the definition and exploration of neighborhood structures. Experimental results on a large set of benchmark problems attest to the efficacy of the proposed approach. © 2010 IFIP.
dc.format.extent
dc.format.extent Pages: (230-237)
dc.language English
dc.relation.ispartof Publication Name: IFIP Advances in Information and Communication Technology; Conference Title: 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations, AIAI 2010; Conference Date: 6 October 2010 through 7 October 2010; Conference Location: Larnaca; Publication Year: 2010; Pages: (230-237);
dc.source Scopus
dc.title A hybrid searching method for the unrelated parallel machine scheduling problem
dc.type Conference Paper
dc.contributor.affiliation Charalambous, C., Department of Computer Science and Engineering, Frederick University, Cyprus
dc.contributor.affiliation Fleszar, K., Olayan School of Business, American University of Beirut (AUB), Lebanon
dc.contributor.affiliation Hindi, K.S., Olayan School of Business, American University of Beirut (AUB), Lebanon
dc.contributor.authorAddress Charalambous, C.; Department of Computer Science and Engineering, Frederick UniversityCyprus; email: c.charalambous@frederick.ac.cy
dc.contributor.authorCorporate University: American University of Beirut; Faculty: Suliman S. Olayan School of Business; Department: School of Business;
dc.contributor.authorDepartment School of Business
dc.contributor.authorDivision
dc.contributor.authorEmail
dc.contributor.faculty Suliman S. Olayan School of Business
dc.contributor.authorInitials
dc.contributor.authorOrcidID
dc.contributor.authorReprintAddress
dc.contributor.authorResearcherID
dc.contributor.authorUniversity American University of Beirut
dc.description.cited
dc.description.citedCount
dc.description.citedTotWOSCount
dc.description.citedWOSCount
dc.format.extentCount 8
dc.identifier.articleNo
dc.identifier.coden
dc.identifier.scopusID 78549289518
dc.relation.ispartofConference Conference Title: 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations, AIAI 2010 : Conference Date: 6 October 2010 through 7 October 2010 , Conference Location: Larnaca.
dc.relation.ispartofConferenceCode 82446
dc.relation.ispartofConferenceDate 6 October 2010 through 7 October 2010
dc.relation.ispartofConferenceLoc Larnaca
dc.relation.ispartofConferenceSponsor Cyprus University of Technology;Frederick University;Cyprus Tourism Organization
dc.relation.ispartofConferenceTitle 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations, AIAI 2010
dc.relation.ispartofPubTitle IFIP Advances in Information and Communication Technology
dc.relation.ispartofPubTitleAbbr IFIP Advances in Information and Communication Technology
dc.type.publication Series
dc.subject.otherAuthKeyword Hybrid Optimization
dc.subject.otherAuthKeyword Mixed-Integer Programming
dc.subject.otherAuthKeyword Parallel Machine Scheduling
dc.subject.otherAuthKeyword Variable Neighborhood Search
dc.subject.otherIndex Bench-Mark Problems
dc.subject.otherIndex Constructive Algorithms
dc.subject.otherIndex Hybrid Optimization
dc.subject.otherIndex Local Optima
dc.subject.otherIndex Minimizing Makespan
dc.subject.otherIndex Mixed-Integer Programming
dc.subject.otherIndex Neighborhood Structure
dc.subject.otherIndex Np-Hard Problem
dc.subject.otherIndex Parallel Machine Scheduling
dc.subject.otherIndex Searching Methods
dc.subject.otherIndex Unrelated Parallel Machines
dc.subject.otherIndex Variable Neighborhood Search
dc.subject.otherIndex Artificial Intelligence
dc.subject.otherIndex Computational Complexity
dc.subject.otherIndex Heuristic Methods
dc.subject.otherIndex Heuristic Programming
dc.subject.otherIndex Machinery
dc.subject.otherIndex Optimization
dc.subject.otherIndex Scheduling Algorithms
dc.subject.otherIndex Integer Programming
dc.identifier.doi http://dx.doi.org/10.1007/978-3-642-16239-8_31


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search AUB ScholarWorks


Browse

My Account