DISCRETE TIME PARALLEL-MACHINE SCHEDULING: A CASE OF SHIP SCHEDULING

References

• Cheng , T. C. E. and Sin , C. C. S. ( 1990 ) A state-of-the-art review of parallel-machine scheduling research . European J. Operational Res. , 47 , 271 – 292 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. and Sin , C. C. S. ( 1991 ) An algorithm for the N/M/parallel/Cmax preemptive due-date scheduling problem . Eng. Costs and Production Econ. , 21 , 43 – 49 .
   Web of Science ®Google Scholar
• DeWerra , D. ( 1988 ) On the two-phase method for preemptive scheduling . European J. Operational Res. , 37 , 227 – 235 .
   Web of Science ®Google Scholar
• Lawler , E. L. and Martel , C.U. ( 1989 ) Preemptive scheduling of two uniform machines to minimize the number of late jobs . Operations Res. , 37 , 314 – 318 .
   Web of Science ®Google Scholar
• Alidaee , B. and Ahmadian , A. ( 1993 ) Two parallel machine sequencing problems involving controllable job processing times . European J. Operational Res. , 70 , 335 – 341 .
   Web of Science ®Google Scholar
• Emmons. H. and Pinedo , M. ( 1990 ) Scheduling stochastic jobs with due dates on parallel machines . European J. Operational Res. , 47 , 49 – 55 .
   Web of Science ®Google Scholar
• De , P. and Morton , T. E. ( 1980 ) Scheduling to minimize makespan on unequal parallel processors . Decision Sci. , II , 586 – 602 .
   Google Scholar
• Dror, M, Stern , H. I. and Lenstra , J. K. ( 1987 ) Parallel machine scheduling Processing rates dependent on number of jobs in operations . Management Sci. , 33 , 1001 – 1009 .
   Web of Science ®Google Scholar
• 9. Crowder , H. , Johnson , E. L. and Padberg , M. ( 1983 ) Solving large-scale zero-one linear programming problems . Operations Res. , 31 , 803 – 834 .
   Web of Science ®Google Scholar
• Johnson , E. L. , Kostreva , M. M. and Suhl , U. H. ( 1985 ) Solving 0-1 integer programming problems arising from large scale planning models . Operations Res. , 33 , 803 – 819 .
   Web of Science ®Google Scholar
• Bulfin , R. L. and Parker , R. G. ( 1980 ) Scheduling jobs on two facilities to minimize makespan . Management Sci. , 26 , 202 – 214 .
   Web of Science ®Google Scholar
• So , K. C. ( 1990 ) Some heuristics for scheduling jobs on parallel machines with setups . Management Sci. , 36 , 467 – 475 .
   Web of Science ®Google Scholar
• Webster , S. T. ( 1983 ) A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems . European J. Operational Res. , 70 , 327 – 334 .
   Web of Science ®Google Scholar
• Ronen , D. ( 1983 ) Cargo ships routing and scheduling Survey of models and problems . European J. Operational Res. , 12 , 119 – 126 .
   Web of Science ®Google Scholar
• Ronen , D. ( 1993 ) Ship scheduling The last decade . European J. Operational Res. , 71 , 325 – 333 .
   Web of Science ®Google Scholar
• Kao, C, Li , D. C. , Wu , C. and Tsai , C. C. ( 1990 ) knowledge-based approach to the optimal dock arrangement , International J. Systems Sci. , 21 , 2209 – 2215 .
   Web of Science ®Google Scholar
• Dogramaci , A. and Surkis , J. ( 1979 ) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors . Management Sci. , 25 , 1208 – 1216 .
   Web of Science ®Google Scholar
• Schrage , L. ( 1987 ) User's manual for LIN DO , 3rd ed. The Scientific Press , Redwood City , CA .
   Google Scholar
• Sahni , S. K. ( 1976 ) Algorithm for scheduling independent tasks . J. Asso. Computing Machinery , 23 , 116 – 127 .
   Web of Science ®Google Scholar