Scheduling of Shipyard Block Assembly Process Using Constraint Satisfaction Problem

We consider a scheduling problem on a shipyard block assembly process. Given a set ofblocks and a set of bays, we need to determine the bay and the starting time to assemble eachblock while satisfying the precedence constraints, the time window constraints and the resourceconstraints. We mainly cons...

Full description

Saved in:
Bibliographic Details
Published in:Asia Pacific management review 2002-03, Vol.7 (1)
Main Authors: Kim, Heemoon, Kang, Jangha, Park, Sungsoo
Format: Article
Language:English
Subjects:
Algorithms
Docks
Scheduling
Shipbuilding
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a scheduling problem on a shipyard block assembly process. Given a set ofblocks and a set of bays, we need to determine the bay and the starting time to assemble eachblock while satisfying the precedence constraints, the time window constraints and the resourceconstraints. We mainly consider two types of resources for each bay: space resource and manpower resource. Our primary objectives are to minimize the number of blocks failed to bescheduled and load balancing for man-power. To solve this problem, an algorithm based on CSP(Constraints Satisfaction Problem) technique is proposed. Computational experiences arereported for real world problems.
ISSN:1029-3132
2589-8213