##
**Minimizing makespan on parallel machines subject to release dates and delivery times.**
*(English)*
Zbl 1009.90047

Summary: We consider the problem of minimizing the makespan on identical parallel machines subject to release dates and delivery times. The objective of this paper is to develop exact branch-and-bound algorithms to solve this strongly NP-hard problem. A preprocessing algorithm is devised to speed up the convergence of the proposed algorithms, and a new tight bounding scheme is introduced. The search tree is also reduced using a polynomial selection algorithm. Extensive computational experiments show that instances with up to 300 jobs can be solved exactly in a moderate CPU time.

### MSC:

90B35 | Deterministic scheduling theory in operations research |

90C57 | Polyhedral combinatorics, branch-and-bound, branch-and-cut |

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

### Keywords:

scheduling; identical parallel machines; makespan; release dates; delivery times; branch-and-bound
PDFBibTeX
XMLCite

\textit{A. Gharbi} and \textit{M. Haouari}, J. Sched. 5, No. 4, 329--355 (2002; Zbl 1009.90047)

Full Text:
DOI

### References:

[17] | Minimizing the makespan in a multiprocessor flow shop. Master’s Thesis, Eindhoven University of Technology, The Netherlands, 1994. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.