摘要：This paper aims to develop further our previous work, which is concerned with a just-in-time scheduling problem of block-assembly lines lines conveyorized in a shipyard. The blocks fabricated are stocked for pre-fitting and painting works and they are provided to pre-election area. We proposed a new method called as Max-Plus Method to solve the problem. In some cases, however, this method can’t satisfy a synchronization constraint that pre-subblocks must be fabricated before the specific subblocks are fabricated. Also it can’t manage the stockyard very well except the utilization of round-robin type. In the paper, another new method called as Heap Method is proposed, which is inspired from the Heap Model in the field of Max-Plus algebra. It is shown that the above unsolved problems can be solved.
