| Article ID: | iaor20062087 |
| Country: | China |
| Volume: | 9 |
| Issue: | 2 |
| Start Page Number: | 63 |
| End Page Number: | 67 |
| Publication Date: | Jun 2005 |
| Journal: | OR Transactions |
| Authors: | Sun Yuqin, Yuan Jin-jiang |
This paper studies the single-machine primary–secondary criteria scheduling problem with an agreeable criterion. Under the case that the jobs' processing times are common and their release dates are agreeble with their due dates, we give a preemptive scheduling polynomial-time algorithm that optionally solves the problem.