Formulações matemáticas para o problema de sequenciamento de lotes com penalidades por atraso
The problem of scheduling on a single machine, proven to be NP-hard, consists of de ning the job grouping in batches and of the sequence in which these batches will be processed on a machine. Each job is associated with a release date, a processing time, a due date, a priority level in relation to t...
| Autor principal: | |
|---|---|
| Formato: | masterThesis |
| Idioma: | por |
| Publicado em: |
2017
|
| Assuntos: | |
| Texto completo: | https://repositorio.ufpb.br/jspui/handle/tede/9265 |
| País: | Brasil |
| Oai: | oai:repositorio.ufpb.br:tede/9265 |