Skip to main content
Journal Article

Minimizing time-dependent total completion time on parallel identical machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3019 89-96
DOI: 10.1007/978-3-540-24669-5_12
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the paper a problem of minimizing the total completion time for deteriorating jobs and parallel identical machines is considered. The processing time of each job is a linear function of the starting time of the job. The properties of an optimal schedule are proved and a greedy heuristic for the problem is proposed. Preliminary results of experimental evaluation of the algorithm are given. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Gawiejnowicz, S., Kurc, W., & Pankowska, L. (2004). Minimizing time-dependent total completion time on parallel identical machines. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 89–96. https://doi.org/10.1007/978-3-540-24669-5_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free