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...
שמור ב:
| Principais autores: | , , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Wiley
2014-01-01
|
| סדרה: | The Scientific World Journal |
| גישה מקוונת: | http://dx.doi.org/10.1155/2014/596306 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|