Minimizing total weighted completion times subject to precedence constraints by dynamic programming

In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the relevance of it. A computational study proves that large instances with up to 120 activities can be solved.

MoreLess

Year of publication:	1998
Authors:	Drexl, Andreas ; Kimms, Alf
Publisher:	Kiel : Universität Kiel, Institut für Betriebswirtschaftslehre
Subject:	Scheduling-Verfahren \| Dynamische Optimierung \| Theorie \| Total weighted completion time objective \| precedence constraints \| dynamic programming

More details

Series:	Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; 475
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	1001285964 [GVK] hdl:10419/147580 [Handle] RePEc:zbw:cauman:475 [RePEc]
Source:	EconStor

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011558733