Approximate solution methods for the parallel machine scheduling problem with total tardiness minimization

被引：0

作者：

Yalaoui, Farouk ^{[1
]}

Bernate Lara, Andres F. ^{[1
]}

Amodeo, Lionel ^{[1
]}

Dugardin, Frederic ^{[1
]}

机构：

[1] Univ Technol Troyes, LOSI, Inst Charles Delaunay, 12 Rue Marie Curie,BP 2060, F-10010 Troyes, France

来源：

PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT | 2011年

关键词：

Parallel machine; scheduling problem; total tardiness; meta-heuristics;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The present article deals with the parallel machine scheduling problem to minimize the total tardiness when jobs have different release dates. In this case, each job has its own release date, processing time and due date. The machines are identical (all the machines have the same speed) and they are available during the entire scheduling period. The schedule can not include preemption or splitting. This problem is considered NP-hard. To our knowledge there are no publications about this particular problem. In this article three approximate solution methods are proposed to solve the problem: a heuristic method adapted from the BHG (Biskup, Heremann and Gupta) heuristic; an Ant colony algorithm; and a Genetic algorithm. The mathematical formulation of the problem is also included. At the end, these different methods are tested on 1125 instances and the obtained results are compared.

引用

页码：334 / 343

页数：10

共 10 条

[1] Tardiness minimization on parallel machines [J].