A Lower Bound for the Weighted Completion Time Variance Problem

We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than 2000 instances shows that this lower bound is very tight.

MoreLess

Year of publication:	2008-11
Authors:	Nessah, Rabia ; Chu, Chengbin
Institutions:	IÉSEG School of Management, Université Catholique de Lille
Subject:	Scheduling \| Single machine \| Weighted completion time variance \| Lower bound \| Heuristic

More details

Extent:	application/pdf
Series:	Working Papers.
Type of publication:	Book / Working Paper
Language:	English
Notes:	Number 2008-ECO-16 17 pages
Source:	RePEc - Research Papers in Economics

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