Research Article
Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents
Input: , and . | Step 1. Set and ,; solve from | for 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 | select the job from with the the smallest cost, that is, , | set , , assign job at time , delete from , | and go to Step 4; | Elseif | report that the instance is not feasible; | Else | go to Step 4; | Step 4. If is not empty or , then | go to Step 2. | Else | stop. |
|