ORBi: Bay Maud - Space and time allocation in a shipyard assembly hall

Reference : Space and time allocation in a shipyard assembly hall


	Document type :	Scientific journals : Article
	Discipline(s) :	Business & economic sciences : Quantitative methods in economics & management Engineering, computing & technology : Civil engineering
	To cite this reference:	http://hdl.handle.net/2268/28166

Title :	Space and time allocation in a shipyard assembly hall
Language :	English
Author, co-author :	Bay, Maud [Université de Liège - ULg > HEC-Ecole de gestion de l'ULg : UER > Recherche opérationnelle et gestion de la production >]
	Crama, Yves [Université de Liège - ULg > HEC-Ecole de gestion de l'ULg : UER > Recherche opérationnelle et gestion de la production >]
	Langer, Yves [ > > ]
	Rigo, Philippe [Université de Liège - ULg > Département ArGEnCo > Constructions hydrauliques et navales >]
Publication date :	Sep-2010
Journal title :	Annals of Operations Research
Publisher :	Springer Science & Business Media B.V.
Volume :	179
Issue/season :	1
Special issue title :	Cutting, Packing, Layout, and Space Allocation
Pages :	57-76
Audience :	International
ISSN :	0254-5330
Keywords :	[en] Space and time allocation problem ; Facility management ; Local search heuristic
Abstract :	[en] We present a space and time allocation problem that arises in assembly halls producing large building blocks (namely, a shipyard which assembles prefabricated keel elements). The building blocks are very large, and, once a block is placed in the hall, it cannot be moved until all assembly operations on this block are complete. Each block must be processed during a predetermined time window. The objective is to maximize the number of building blocks produced in the hall. The problem is modeled as a 3-dimensional bin packing problem (3D-BPP) and is handled by a Guided Local Search heuristic initially developed for the 3D-BPP. Our com- putational experiments with this heuristic demonstrate that excellent results can be found within minutes on a workstation, and that the heuristic outperforms a standard constraint programming approach. We also describe some additional real-life constraints arising in the industrial application and show how these constraints can be conveniently integrated in the model.
Research units :	QuantOM
Target :	Researchers ; Professionals
Permalink :	http://hdl.handle.net/2268/28166
DOI :	10.1007/s10479-008-0461-8
Other URL :	http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s10479-008-0461-8

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	20091110162007461.pdf		Publisher postprint	1.49 MB	View/Open

All documents in ORBi are protected by a user license.

Dspace v1.5