Time-cost tradeoff in a three-dimensional assignment problem
type: Item
instance of: scholarly article
title: Time-cost tradeoff in a three-dimensional assignment problem
zbMATH Open document ID: 0676.90044
DOI: 10.1016/0377-2217(89)90111-2
author: S. H. Smith
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
review text: The paper discusses the three-dimensional assignment problem with two objective functions. The prototype problem is that there are n jobs, n machines, and n workers. The decision variable \(x_{ijk}\) has a value of 1 if the j-th job is assigned to the i-th worker to be performed on the k-th machine, otherwise the value is 0. Both cost and throughput time are to be minimized. These objectives are usually conflicting, therefore a multiobjective approach is necessary. The authors define a tradeoff ratio which helps evaluating a sequence of solutions with increasing cost and decreasing time. A pair with minimum ratio is accepted as optimal solution of the problem. Some heuristic arguments are also given.
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4108485
zbMATH Keywords: three-dimensional assignment
zbMATH Keywords: two objective functions
reviewed by: István Maros
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90111-2
OpenAlex ID: W1997253559
cites work: Q3760293
cites work: Q5519710
cites work: Q5519711
cites work: An Algorithm for the Traveling Salesman Problem
cites work: The three dimensional bottleneck assignment problem and its variants
cites work: Un algoritmo misto per il problema dell'assegnazione pluridimensionale
cites work: Letter to the Editor—The Multidimensional Assignment Problem
cites work: Q3033559
description: scientific article; zbMATH DE number 4108485