Title: Solving a bicriterion scheduling problem
Authors: Van Wassenhove, L
Gelders, Ludo #
Issue Date: Jan-1980
Publisher: Elsevier Science BV
Series Title: European Journal of Operational Research vol:4 issue:1 pages:42-48
Abstract: Consider n jobs to be sequenced on a single machine. The objective functions to be minimized are the holding cost and the maximum tardiness. We first characterize the set of efficient points and then proceed to give a pseudo-polynomial algorithm to enumerate all these efficient points. Computational results illustrate the usefulness of the procedure.
ISSN: 0377-2217
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Centre for Industrial Management / Traffic & Infrastructure
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science