| Article ID: | iaor1995944 |
| Country: | Netherlands |
| Volume: | 52 |
| Issue: | 3 |
| Start Page Number: | 253 |
| End Page Number: | 259 |
| Publication Date: | Aug 1994 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Ishii Hiroaki, Masuda Teruo |
| Keywords: | networks: scheduling |
In this paper the authors consider a bi-criteria two machine open shop scheduling problem. The two criteria to be maximized are maximum completion time and maximum lateness. The authors show that either there exists a unique optimal solution, or there exists a line segment of nondominated solutions.