[in Journal: International Journal on Artificial Intelligence Tools] AND [Keyword: Makespan] : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
[in Journal: International Journal on Artificial Intelligence Tools] AND [Keyword: ... (1)	27 Mar 2025	Run
[in Journal: International Journal of Computational Intelligence and Applications] ... (1)	27 Mar 2025	Run
[in Journal: Non-Series Books] AND [Keyword: Cracking] (5)	27 Mar 2025	Run
[in Journal: Non-Series Books] AND [Keyword: Makespan] (3)	27 Mar 2025	Run
[Keyword: Barcodes] AND [All Journals] (5)	27 Mar 2025	Run

articleNo Access
MINIMIZING THE MAKESPAN FOR UNRELATED PARALLEL MACHINES
- YUNSONG GUO,
- ANDREW LIM,
- BRIAN RODRIGUES, and
- LIANG YANG
International Journal on Artificial Intelligence Tools01 Jun 2007
Preview Abstract
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective heuristic for the problem: Squeaky Wheel Optimization (SWO) hybrid with TS. Experimental results average 2.52% from the lower bound and are within acceptable timescales improving current best results for the problem.

1