Some results of the relocation problems with processing times and deadlines

References

• Amir , A. and Kaplan , E.H. 1988 . Relocation problems are hard . Intern, J. of Computer Math , 25 ( 4 )
   Google Scholar
• Blazewicz , J. , Finke , G. , Haupt , H. and Schmit , G. 1988 . New trends in machine scheduling . European Journal of Operational Research , 37 : 303 – 317 .
   Web of Science ®Google Scholar
• Blazewicz , J. , Lenstra , J.K. and Rinnoy Kan , A.H.G. 1989 . Scheduling subject to resource constraints: classification and complexity . Discrete Applied Mathematics , 5 : 11 – 24 .
   Web of Science ®Google Scholar
• Garey , M.R. and Johnson , D.S. 1977 . Two processor scheduling with starting times and deadlines . SIAMJ. Comput , 6 : 416 – 426 .
   Google Scholar
• Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability: A guide to the theory of NP-completeness , San Francisco, CA : Freeman .
   Google Scholar
• Hsu , C.H. 1990 . A Study of the Relocation Problem , Hsinchu, , Taiwan : National Chiao Tung University . Master thesis
   Google Scholar
• Johnson , S.M. 1954 . Optimal 2- and 3-stage Production Schedules with Setup Times Included . NavalResearch Logistic Quarterly , 1 ( 1 )
   Google Scholar
• Kaplan , E.H. 1986 . Relocation Models for Public Housing Redevelopment Programs . Planning and Design , 13 ( 1 )
   Web of Science ®Google Scholar
• Kaplan , E.H. and Amir , A. 1988 . Theory and Methodology: A fast feasibility test for relocation problems . European Journal of Operations Research , 35 ( 2 )
   Web of Science ®Google Scholar
• Kaplan , E.H. and Berman , O. 1988 . OR Hits the Heights: Relocation planning at the Orient Heights housing project . Interfaces , 18 ( 6 )
   Web of Science ®Google Scholar
• Lin M.T. Tseng S.S. Hsu C.H. On the relocation problems with precedence constraints to be submitted
   Google Scholar
• Tarjan , R.E. 1975 . Efficiency of a good but not linear set union algorithm . J. Assoc. Comput. Mach , 22 ( 6 ) : 215 – 225 .
   Google Scholar