EUDML | Optimal scheduling of the $3$-machine assembly-type flow shop

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Optimal scheduling of the $3$ -machine assembly-type flow shop”

An exact method for solving the multi-processor flow-shop

Jacques Carlier, Emmanuel Néron (2000)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A new class of scheduling criteria and their optimization

Chengbin Chu (1996)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

On the application of insertion techniques for job shop problems with setup times

Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Optimal scheduling of the 3-machine assembly-type flow shop

Mohamed Haouari, Thouraya Daouas (2010)

RAIRO - Operations Research

Similarity:

We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.