Solving a multiprocessor problem by column generation and branch-and-price
This work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A task is malleable if we can freely change the set o...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/2670 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/2670 |