Modeling and solving the spatial block scheduling problem in a shipbuilding company

We consider the block scheduling problem arising in a shipyard. The problem is complicated since we are considering both scheduling and spatial allocation of each block simultaneously. Moreover, varying conditions in several work spaces should be reflected. We develop a scheduling algorithm using partial enumeration and decomposition. An efficient heuristic search procedure for the spatial allocation of blocks is also devised. Copyright (C) 1996 Elsevier Science Ltd
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1996-07
Language
ENG
Citation

COMPUTERS & INDUSTRIAL ENGINEERING, v.30, no.3, pp.357 - 364

ISSN
0360-8352
URI
http://hdl.handle.net/10203/7557
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 470
  • Download : 16
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 27 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0