Cart (Loading....) | Create Account
Close category search window

Ant Colony System based approach to single machine scheduling problems: Weighted tardiness scheduling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Madureira, A. ; GECAD Res. Group-Sch. of Eng., Polytech. Inst. of Porto, Porto, Portugal ; Falcao, D. ; Pereira, I.

The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.

Published in:

Nature and Biologically Inspired Computing (NaBIC), 2012 Fourth World Congress on

Date of Conference:

5-9 Nov. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.