Minimizing average completion time in the presence of release dates

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1998 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 82, pages 199-223 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )Funded by:NSF | Algorithms for Scheduling..., NSF | Research Initiation Award...

Authors: Phillips, Cynthia; Stein, Clifford; Wein, Joel;

doi: 10.1007/bf01585872

Minimizing average completion time in the presence of release dates

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Polytechnic University of New York
United States
Dartmouth College
United States
New York University
United States
Sandia National Laboratories California
United States

Keywords

constant-factor approximation algorithms, Deterministic scheduling theory in operations research, Linear programming, average weighted completion time, relaxations, NP-hard, preemptive and nonpreemptive schedules, average completion time, parallel machine models

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	79
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%