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!
cited_by
cites
container_end_page
container_issue 1
container_start_page
container_title Asia Pacific management review
container_volume 7
creator Kim, Heemoon
Kang, Jangha
Park, Sungsoo
description 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.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_1115661793</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2801558631</sourcerecordid><originalsourceid>FETCH-proquest_journals_11156617933</originalsourceid><addsrcrecordid>eNqNykELgjAYxvERBUn5HQadBefU9FhSdAyss0ydOZub7Z0Hv30KfYCey__w_FbICaIk9ZKA0DVyiB-kHiU02CIXoPPnhSkNQ-KgPK9aXo9SqBfWDc5bMUzM1PgsdfXGJwDel3LCd6MrDoCfsMBMK7CGCWVxzqyAhlVWaLWoUvJ-jzYNk8DdX3focL08sps3GP0ZOdii06NR81UQQqI4JseU0v_UF9FqQiw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1115661793</pqid></control><display><type>article</type><title>Scheduling of Shipyard Block Assembly Process Using Constraint Satisfaction Problem</title><source>Publicly Available Content Database</source><source>ABI/INFORM Global</source><creator>Kim, Heemoon ; Kang, Jangha ; Park, Sungsoo</creator><creatorcontrib>Kim, Heemoon ; Kang, Jangha ; Park, Sungsoo</creatorcontrib><description>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.</description><identifier>ISSN: 1029-3132</identifier><identifier>EISSN: 2589-8213</identifier><language>eng</language><publisher>Tainan: National Cheng Kung University, College of Management</publisher><subject>Algorithms ; Docks ; Scheduling ; Shipbuilding</subject><ispartof>Asia Pacific management review, 2002-03, Vol.7 (1)</ispartof><rights>Copyright National Cheng Kung University, College of Management Mar 2002</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/1115661793?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,11688,25753,36060,37012,44363,44590</link.rule.ids></links><search><creatorcontrib>Kim, Heemoon</creatorcontrib><creatorcontrib>Kang, Jangha</creatorcontrib><creatorcontrib>Park, Sungsoo</creatorcontrib><title>Scheduling of Shipyard Block Assembly Process Using Constraint Satisfaction Problem</title><title>Asia Pacific management review</title><description>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.</description><subject>Algorithms</subject><subject>Docks</subject><subject>Scheduling</subject><subject>Shipbuilding</subject><issn>1029-3132</issn><issn>2589-8213</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><sourceid>PIMPY</sourceid><recordid>eNqNykELgjAYxvERBUn5HQadBefU9FhSdAyss0ydOZub7Z0Hv30KfYCey__w_FbICaIk9ZKA0DVyiB-kHiU02CIXoPPnhSkNQ-KgPK9aXo9SqBfWDc5bMUzM1PgsdfXGJwDel3LCd6MrDoCfsMBMK7CGCWVxzqyAhlVWaLWoUvJ-jzYNk8DdX3focL08sps3GP0ZOdii06NR81UQQqI4JseU0v_UF9FqQiw</recordid><startdate>20020301</startdate><enddate>20020301</enddate><creator>Kim, Heemoon</creator><creator>Kang, Jangha</creator><creator>Park, Sungsoo</creator><general>National Cheng Kung University, College of Management</general><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BVBZV</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>K60</scope><scope>K6~</scope><scope>K8~</scope><scope>L.-</scope><scope>M0C</scope><scope>M2O</scope><scope>MBDVC</scope><scope>PIMPY</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20020301</creationdate><title>Scheduling of Shipyard Block Assembly Process Using Constraint Satisfaction Problem</title><author>Kim, Heemoon ; Kang, Jangha ; Park, Sungsoo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_11156617933</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Algorithms</topic><topic>Docks</topic><topic>Scheduling</topic><topic>Shipbuilding</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Heemoon</creatorcontrib><creatorcontrib>Kang, Jangha</creatorcontrib><creatorcontrib>Park, Sungsoo</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>East &amp; South Asia Database</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>DELNET Management Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>ProQuest research library</collection><collection>Research Library (Corporate)</collection><collection>Publicly Available Content Database</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Asia Pacific management review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kim, Heemoon</au><au>Kang, Jangha</au><au>Park, Sungsoo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling of Shipyard Block Assembly Process Using Constraint Satisfaction Problem</atitle><jtitle>Asia Pacific management review</jtitle><date>2002-03-01</date><risdate>2002</risdate><volume>7</volume><issue>1</issue><issn>1029-3132</issn><eissn>2589-8213</eissn><abstract>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.</abstract><cop>Tainan</cop><pub>National Cheng Kung University, College of Management</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1029-3132
ispartof Asia Pacific management review, 2002-03, Vol.7 (1)
issn 1029-3132
2589-8213
language eng
recordid cdi_proquest_journals_1115661793
source Publicly Available Content Database; ABI/INFORM Global
subjects Algorithms
Docks
Scheduling
Shipbuilding
title Scheduling of Shipyard Block Assembly Process Using Constraint Satisfaction Problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T17%3A47%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scheduling%20of%20Shipyard%20Block%20Assembly%20Process%20Using%20Constraint%20Satisfaction%20Problem&rft.jtitle=Asia%20Pacific%20management%20review&rft.au=Kim,%20Heemoon&rft.date=2002-03-01&rft.volume=7&rft.issue=1&rft.issn=1029-3132&rft.eissn=2589-8213&rft_id=info:doi/&rft_dat=%3Cproquest%3E2801558631%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_11156617933%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1115661793&rft_id=info:pmid/&rfr_iscdi=true