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

Jacques Carlier; Emmanuel Neron

RAIRO - Operations Research (2010)

  • Volume: 34, Issue: 1, page 1-25
  • ISSN: 0399-0559

Abstract

top
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.

How to cite

top

Carlier, Jacques, and Neron, Emmanuel. "An Exact Method for Solving the Multi-Processor Flow-Shop." RAIRO - Operations Research 34.1 (2010): 1-25. <http://eudml.org/doc/197780>.

@article{Carlier2010,
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. },
author = {Carlier, Jacques, Neron, Emmanuel},
journal = {RAIRO - Operations Research},
keywords = {Branch and bound; multi-processor flow-shop; m-machine problems; inputs and selection.; inputs and selection; -machine problems; branch and bound method},
language = {eng},
month = {3},
number = {1},
pages = {1-25},
publisher = {EDP Sciences},
title = {An Exact Method for Solving the Multi-Processor Flow-Shop},
url = {http://eudml.org/doc/197780},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Carlier, Jacques
AU - Neron, Emmanuel
TI - An Exact Method for Solving the Multi-Processor Flow-Shop
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 1
SP - 1
EP - 25
AB - 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.
LA - eng
KW - Branch and bound; multi-processor flow-shop; m-machine problems; inputs and selection.; inputs and selection; -machine problems; branch and bound method
UR - http://eudml.org/doc/197780
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.