中文

Journal of Shanghai University（Natural Science Edition）

• Articles • Previous Articles     Next Articles

Scheduling of Goods Loading and Unloading within Common Due Window

LU Yan-ping,SUN Shi-jie,TAN Fang   

  1. School of Sciences, Shanghai University, Shanghai 200444， China
  • Received:2005-04-12 Revised:1900-01-01 Online:1900-01-01 Published:1900-01-01
  • Contact: SUN Shi-jie

Cited

1

Abstract:

This paper studies the following relationship between shipowner and harbor in loading and unloading goods: n ships arrive at the same harbor at time zero. It is hoped to finish loading and unloading goods within the same due window ［d,D］. If a ship finishes its work after D, the ship owner will penalize the harbor. If a ship finishes its work before d, the ship owner will reward the harbor. Thus the harbor needs to arrange the loading and unloading sequence in an

optimal manner for these ships so that the total cost is minimized. To deal wit

h such an NPhard problem, the paper proposes two dynamic programming algorithm

s, a branch and bound algorithm with a polynomial solvable case.

Key words: algorithm, award, common due window, penalty, scheduling