Hostname: page-component-848d4c4894-xm8r8 Total loading time: 0 Render date: 2024-07-01T14:29:49.655Z Has data issue: false hasContentIssue false
  • English
  • Français

An Exact Method for Solving the Multi-Processor Flow-Shop

Published online by Cambridge University Press:  15 August 2002

Jacques Carlier  and
Emmanuel Neron
Jacques Carlier
Affiliation:
UMR CNRS 6599 HEUDIASYC, Centre de Recherches de Royallieu, Université de Technologie de Compiègne, 60205 Compiègne Cedex, France.
Emmanuel Neron
Affiliation:
UMR CNRS 6599 HEUDIASYC, Centre de Recherches de Royallieu, Université de Technologie de Compiègne, 60205 Compiègne Cedex, France.
Get access

Abstract

The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced. As shown by our personal study, the overall method is very efficient.

Keywords

Branch and boundmulti-processor flow-shopm-machine problemsinputs and selection.
Type
Research Article
Information
RAIRO - Operations Research , Volume 34 , Issue 1 , January 2000 , pp. 1 - 25
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)