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

Parallel-machine scheduling concerns scheduling a number of jobs on more than one processor working in parallel. A medium-term ship scheduling problem frequently encountered in ports is the scheduling of arriving ships so as to minimize the total demurrage cost incurred. This problem is in fact a parallel-machine scheduling problem, and can be formulated as a pure zero-one integer program when time is discrete. Different from the usual parallel-machine scheduling studies, the ready time of each job is not required to be identical. As an illustration, the ship scheduling problem faced by China Steel Corporation in Taiwan is discussed and solved- The proposed model is applicable to other deterministic parallel-machine scheduling problems in which jobs have to be processed continuously on the same or different machines

[1]  Jan Karel Lenstra,et al.  Parallel machine scheduling: processing rates dependent on number of jobs in operation , 1987 .

[2]  Michael Pinedo,et al.  Scheduling stochastic jobs with due dates on parallel machines , 1990 .

[3]  Der-Chiang Li,et al.  Knowledge-based approach to the optimal dock arrangement , 1990 .

[4]  R. L. Bulfin,et al.  Scheduling Jobs on Two Facilities to Minimize Makespan , 1980 .

[5]  Michael M. Kostreva,et al.  Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models , 1985, Oper. Res..

[6]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[7]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[8]  C.C.S. Sin,et al.  An algorithm for the N/M/parallel/Cmaxpreemptive due-date scheduling problem , 1991 .

[9]  Julius Surkis,et al.  Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors , 1979 .

[10]  Bahram Alidaee,et al.  Two parallel machine sequencing problems involving controllable job processing times , 1993 .

[11]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[12]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[13]  D. de Werra,et al.  On the two-phase method for preemptive scheduling , 1988 .

[14]  Charles U. Martel,et al.  Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs , 1989, Oper. Res..

[15]  D Ronen,et al.  CARGO SHIPS ROUTING AND SCHEDULING: SURVEY OF MODELS AND PROBLEMS. IN: MARITIME TRANSPORT , 1983 .

[16]  Scott Webster.  A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems , 1993 .

[17]  Prabuddha De,et al.  SCHEDULING TO MINIMIZE MAKESPAN ON UNEQUAL PARALLEL PROCESSORS , 1980 .

[18]  David Ronen,et al.  Ship scheduling: The last decade , 1993 .