- Tytuł:
- A new optimal algorithm for a time-dependent scheduling problem
- Autorzy:
-
Kubale, M.
Ocetkiewicz, K. M. - Powiązania:
- https://bibliotekanauki.pl/articles/969669.pdf
- Data publikacji:
- 2009
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Tematy:
-
scheduling
single machine
deteriorating jobs
total completion time
algorithms - Opis:
- In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1,...,jn, and the processing time pi of the i-th job is given by pi = 1 + biSi, where si is the starting time of the i-th job, i = 1,...n. If all jobs have different and non-zero deterioration rates and bi [wzór], where bmin = min{bi}, then an optimal schedule can be found in O(n log n) time. The conducted computational experiments show that the presented algorithm performs very well even on data not satisfying the assumed constraints.
- Źródło:
-
Control and Cybernetics; 2009, 38, 3; 713-721
0324-8569 - Pojawia się w:
- Control and Cybernetics
- Dostawca treści:
- Biblioteka Nauki
Artykuł