Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Lichtenstein, M." wg kryterium: Autor


Wyświetlanie 1-4 z 4
Tytuł:
Resource management in machine scheduling problems: a survey
Autorzy:
Janiak, A.
Janiak, W.
Lichtenstein, M.
Powiązania:
https://bibliotekanauki.pl/articles/1203940.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
resource allocation
resource dependent processing times
resource dependent release dates
Opis:
The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models in which the job processing time or the job release date is given as a linear or convex function dependent on the amount of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely scheduling problems that appear in real life. Thus, in this paper we present the computational complexity results and solution algorithms that have been developed for this kind of problems.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 59-89
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling jobs with linear model of simultaneous ageing and learning effects
Autorzy:
Janiak, A.
Lichtenstein, M.
Rusoń, A.
Powiązania:
https://bibliotekanauki.pl/articles/375890.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
sequencing
single machine
learning effect
ageing effect
computational complexity
Opis:
In the paper, we introduce some new scheduling model in which learning and aging effects are both considered simultaneously. In this model the actual processing time of the jobs depends only on its position in a schedule and can be described by the piecewise linear function. For single-processor problem with introduced model, we show that the problem of minimizing the makespan criterion for independent jobs with release dates is strongly NP-hard, but some special cases of this problem are polynomially solvable. Based on those special cases, we propose 4 heuristic algorithms and we experimentally examine their usefulness for solving the general problem.
Źródło:
Decision Making in Manufacturing and Services; 2011, 5, 1-2; 37-48
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling problems with a common due window assignment: a survey
Autorzy:
Janiak, A.
Kwiatkowski, T.
Lichtenstein, M.
Powiązania:
https://bibliotekanauki.pl/articles/330540.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
scheduling
due window assignment
earliness/tardiness
practical example
szeregowanie
wcześniej/później
przykład zastosowania
Opis:
In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this survey we separately analyse the classical models with job-independent and job-dependent earliness/tardiness penalty functions and some other more complicated models. We describe the computational complexity of the problems and the main features of the approaches developed to solve them. Particular attention is paid to practical applications of the analysed models. As turns out, some complicated models combining classical scheduling problems with, e.g., learning and aging effects have no reasonable practical justification in the literature.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 231-241
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scanning Tunneling Spectroscopy Study of Surface States of 3d Metals: Chemical Identification, Magnetic Contrast and Orbital Kondo Resonance States
Autorzy:
Bischoff, M. M. J.
Fang, C. M.
de Groot, R. A.
Heijnen, G. M. M.
Katsnelson, M. I.
Kolesnychenko, O. Yu.
de Kort, R.
Lichtenstein, A. I.
Quinn, A. J.
Vasquez de Parma, A. L.
Yamada, T. K.
van Kempen, H.
Powiązania:
https://bibliotekanauki.pl/articles/2036891.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
73.20.-r
68.37.-d
75.70.-i
Opis:
The surface states of 3d transition metals are studied by scanning tunneling microscopy and scanning tunneling spectroscopy. The results show that surface states can be used for chemical identification with high spatial resolution. The spin polarized nature of the surface states allows us to obtain magnetic contrast in scanning tunneling miroscopy imaging with near atomic resolution. For Cr(100) we found that the surface state close to the Fermi level can be explained by an orbital Kondo resonance surface state.
Źródło:
Acta Physica Polonica A; 2003, 104, 3-4; 231-243
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies