Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive th...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Wiley
2014-01-01
|
| Schriftenreihe: | The Scientific World Journal |
| Online-Zugang: | http://dx.doi.org/10.1155/2014/596306 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|