Normal view MARC view

A Set partitioning heuristic for the Generalized Assignment Problem

Author: Van Wassenhove, Luk N. ; Cattrysse, Dirk ; Salomon, MarcINSEAD Area: Technology and Operations ManagementIn: European Journal of Operational Research, vol. 46, no. 1, May 1990 Language: EnglishDescription: p. 38-47.Type of document: INSEAD ArticleNote: Please ask us for this itemAbstract: This paper discusses a heuristic for the generalized assignment problem (GAP). The objective of GAP is to minimize the costs of assigning 'J' jobs to 'M' capacity constrained machines, such that each job is assigned to exactly one machine. The problem is known to be NP-hard, and it is hard from a computational point of view as well. The heuristic proposed here is based on column generation techniques, and yields both upper and lower bounds. On a set of relatively hard test problems the heuristic is able to find solutions that are on average within 0.13% from optimally
Tags: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
INSEAD Article Europe Campus
Available BC003815
Total holds: 0

Ask Qualtrics

This paper discusses a heuristic for the generalized assignment problem (GAP). The objective of GAP is to minimize the costs of assigning 'J' jobs to 'M' capacity constrained machines, such that each job is assigned to exactly one machine. The problem is known to be NP-hard, and it is hard from a computational point of view as well. The heuristic proposed here is based on column generation techniques, and yields both upper and lower bounds. On a set of relatively hard test problems the heuristic is able to find solutions that are on average within 0.13% from optimally

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 18.11 - INSEAD Catalogue
Home | Contact Us | What's Koha?