Paper Title:
ACO Algorithm for Scheduling Complex Unrelated Parallel Machine
  Abstract

This Paper Addresses an Unrelated Parallel Machine Scheduling Problem with Job Sequence-Dependent Setup Times. Jobs Have Precedence Constraints. the Objective Is to Minimize the Makespan. the Problem Has Applications in Industries such as TFT-LCD, Textile Manufactures. the Problem Is NP-Hard in Strong Sense. Therefore, an Ant Colony Optimization (ACO) Algorithm Is Introduced to Solve this NP-Hard Problem. the Proposed ACO Tackles the Special Structure of the Problem. its Performance Is Evaluated by Comparing its Solutions with Cplex Method. the Results Show that ACO Outperformed the Cplex Method.

  Info
Periodical
Advanced Materials Research (Volumes 268-270)
Edited by
Feng Xiong
Pages
297-302
DOI
10.4028/www.scientific.net/AMR.268-270.297
Citation
G. B. Liu, Q. Zhu, J. Zhang, "ACO Algorithm for Scheduling Complex Unrelated Parallel Machine", Advanced Materials Research, Vols. 268-270, pp. 297-302, 2011
Online since
July 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Hong Kui Feng, Jin Song Bao, Jin Ye
Abstract:A lot of practical problem, such as the scheduling of jobs on multiple parallel production lines and the scheduling of multiple vehicles...
717
Authors: Qiao Xian Zheng, Yuan Xiang Li, Ming Li, Qiu Hua Tang
Abstract:An improvement ant colony optimization(ACO) is proposed to solve the simple assembly line balancing problem of type-1 (SALBP-1) which aims to...
51