Research Article
Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
Input: , , and . | Step 1. Set , and ; | sort the -jobs according to the non-decreasing order of , that is, | ; | calculate the deadlines of the -jobs from and renumber them | according to the non-decreasing order such that ; | Step 2. If , then | If , then | set , , assign job at time , and go to Step 2; | Else | go to Step 3; | Else | go to Step 3; | Step 3. If , then | set , , , assign at time , and go to Step 4; | Elseif | output that the instance is not feasible; | Else | go to Step 4; | Step 4. If or , then | go to Step 2. | Else | stop. |
|