Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

descriptionPublicationkeyboard_double_arrow_right Article 04 Dec 2009 English Publisher:Springer Science and Business Media LLCJournal:Journal of Scheduling, volume 14, pages 257-265 (issn: 1094-6136, eissn: 1099-1425,

Copyright policy )

Authors: Kacem, Imed; Kellerer, Hans;

doi: 10.1007/s10951-009-0146-4

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Keywords

single-machine, non-availability constraint, Deterministic scheduling theory in operations research, flow-time, [INFO] Computer Science [cs], Approximation methods and heuristics in mathematical programming, approximation

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).	11
	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.	Average
	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 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average