Parallel machine scheduling to minimize total tardiness - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Economics Year : 2002

Parallel machine scheduling to minimize total tardiness

(1) , (1)
1

Abstract

This paper addresses, using an exact method, the identical parallel machine scheduling problem to minimize total tardiness. In this problem, a set of jobs has to be scheduled, without preemption, on identical parallel machines. Each machine is able to treat only one job at a time. In order to prune the search tree, dominance properties are proved and lower and upper bounding schemes are proposed. A branch and bound (BAB) algorithm is developed taking into account these theoretical properties, lower and upper bounds. This BAB algorithm has been tested on a large set of randomly generated medium-sized problems. Computational results demonstrate the effectiveness of our approach over existing methods in the literature.

Dates and versions

hal-02501003 , version 1 (06-03-2020)

Identifiers

Cite

Farouk Yalaoui, Chengbin Chu. Parallel machine scheduling to minimize total tardiness. International Journal of Production Economics, 2002, 76 (3), pp.265-279. ⟨10.1016/S0925-5273(01)00175-X⟩. ⟨hal-02501003⟩

Collections

CNRS UTT LOSI
31 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More