Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
This study considers a scheduling environment in which there are two agents and a set of jobs, each of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear function of its starting time. Each of the two agents competes to process its respective jobs...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/471016 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This study considers a scheduling environment in which there are two agents and a set of jobs, each
of which belongs to one of the two agents and its actual processing time is defined as a decreasing linear
function of its starting time. Each of the two agents competes to process its respective jobs on a single
machine and has its own scheduling objective to optimize. The objective is to assign the jobs so that the
resulting schedule performs well with respect to the objectives of both agents. The objective functions
addressed in this study include the maximum cost, the total weighted completion time, and the discounted
total weighted completion time. We investigate three problems arising from different combinations of the
objectives of the two agents. The computational complexity of the problems is discussed and solution
algorithms where possible are presented. |
|---|---|
| ISSN: | 2356-6140 1537-744X |