Welcome to the InfoSci Platform
Reference Hub6
Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates

Farouk Yalaoui
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 26
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466610712|DOI: 10.4018/jaec.2012010102
Cite Article Cite Article

MLA

Yalaoui, Farouk. "Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates." IJAEC vol.3, no.1 2012: pp.21-46. http://doi.org/10.4018/jaec.2012010102

APA

Yalaoui, F. (2012). Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates. International Journal of Applied Evolutionary Computation (IJAEC), 3(1), 21-46. http://doi.org/10.4018/jaec.2012010102

Chicago

Yalaoui, Farouk. "Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates," International Journal of Applied Evolutionary Computation (IJAEC) 3, no.1: 21-46. http://doi.org/10.4018/jaec.2012010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The considered problem is the scheduling of a set of jobs on identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant Colony Algorithm (ACO), a Tabu Search (TS) method, a set of Heuristics based on priority rules and an adapted Biskup Hermann Gupta (BHG) method are proposed to solve the problem. The obtained results are discussed and analyzed.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.