Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics a structural property is introduced. Such a property provides an upper bound on the idle time of the machines between the setup task a...
| Authors: | , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 2007 |
| Country: | Brasil |
| Institution: | Universidade Federal do Ceará (UFC) |
| Repository: | Repositório Institucional da Universidade Federal do Ceará (UFC) |
| Language: | Portuguese |
| OAI Identifier: | oai:repositorio.ufc.br:riufc/67105 |
| Online Access: | http://www.repositorio.ufc.br/handle/riufc/67105 |
| Access Level: | Open access |
| Keyword: | Programação da produção Flow shop permutacional Tempos de setup |
| Summary: | This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics a structural property is introduced. Such a property provides an upper bound on the idle time of the machines between the setup task and the job processing. As an application of this property, the original scheduling problem with the makespan criterion can be heuristically solved by an analogy with the asymmetric traveling salesman problem. |
|---|