Um problema de sequenciamento em máquinas paralelas não-relacionadas com tempos de preparação dependentes de máquina e da sequência:: modelos e algoritmos exato.
=== A scheduling problem with unrelated parallel machines, sequence and machine dependent setup times, due dates and weighted jobs is considered in this work. Two mixed integer programing (MIP) models based on classic strategies from the literature are evaluated. A Branch-and-Bound algorithm (B&...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | Portuguese |
| Published: |
Universidade Federal de Minas Gerais
2006
|
| Online Access: | http://hdl.handle.net/1843/SLBS-6XYFKA |