Linear Arrangements with Closeness Constraints

dc.contributor.author	Shirmohammad, Pedram
dc.contributor.department	Chalmers tekniska högskola / Institutionen för data och informationsteknik	sv
dc.contributor.examiner	Jansson, Patrik
dc.contributor.supervisor	Damaschke, Peter
dc.date.accessioned	2020-09-18T13:40:35Z
dc.date.available	2020-09-18T13:40:35Z
dc.date.issued	2020	sv
dc.date.submitted	2020
dc.description.abstract	In this thesis we will examine the product location problem on a pick-by-order policy. We restrict the scope of this thesis to a single rack with a front depot and each order can consist of at most two products. We present a polynomial solution for an arbitrary graph where the optimal arrangement of each component is given and present a polynomial solution for forests consisting of trees of, at most, order three.	sv
dc.identifier.coursecode	DATX05	sv
dc.identifier.uri	https://hdl.handle.net/20.500.12380/301736
dc.language.iso	eng	sv
dc.setspec.uppsok	Technology
dc.subject	Computer science	sv
dc.subject	linear arrangement	sv
dc.subject	product location problem	sv
dc.subject	order picking	sv
dc.subject	graphs	sv
dc.title	Linear Arrangements with Closeness Constraints	sv
dc.type.degree	Examensarbete för masterexamen	sv
dc.type.uppsok	H

Ladda ner

Visar 1 - 1 av 1

Visar 1 - 1 av 1