Zobrazeno 1 - 10
of 55
pro vyhledávání: '"I. Adiri"'
Autor:
I. Adiri, O. Hamberg
Publikováno v:
Naval Research Logistics. 45:51-66
Consider n jobs (J 1 ,..., J n ), m working stations (M 1 ,..., M m ) and λ linear resources (R 1 ,..., R λ ). Job J i consists of m operations (O i1 ,...,O im ). Operation O ij requires P k (i,j) units of resource R k to be realized in an M j . Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5d2e9937a6b5847bffcab6ac6738582
https://doi.org/10.1002/(sici)1520-6750(199802)45:1<51::aid-nav3>3.0.co
https://doi.org/10.1002/(sici)1520-6750(199802)45:1<51::aid-nav3>3.0.co
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Computers & Operations Research. 11:275-284
This paper deals with efficiently solvable special cases of openshop and permutation-flowshop scheduling where the objective function is minimum sum of completion times. Two O(mn) algorithms for openshop scheduling where all operations have equal pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93942fd6074953ea69771fbe02050ac8
https://doi.org/10.1016/0305-0548(84)90016-9
https://doi.org/10.1016/0305-0548(84)90016-9
Autor:
I. Adiri, Shmuel Stashevsky
Publikováno v:
Operations Research. 26:1020-1032
This paper deals with the design of a computerized message-switching center using a mini-computer. We use two complementary approaches: an approximate mathematical model and more realistic simulations. Results are compared and discussed.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7638a4ff722dfda19c18c85abcff5c03
https://doi.org/10.1287/opre.26.6.1020
https://doi.org/10.1287/opre.26.6.1020
Autor:
I. Adiri, Z. Yehudai
Publikováno v:
Computers & Operations Research. 14:289-297
This paper deals with scheduling on single and parallel machines where the service rate of a machine remains constant while a job is being processed and is changed upon its completion. Associated with machine M l there is a vector of service factors
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18e275d80029ba282dea73242de49285
https://doi.org/10.1016/0305-0548(87)90066-9
https://doi.org/10.1016/0305-0548(87)90066-9
Autor:
D. Pohoryles, I. Adiri
Publikováno v:
Naval Research Logistics Quarterly. 29:495-504
This paper deals with flowshop/sum of completion times scheduling problems, working under a “no-idle” or a “no-wait” constraint, the former prescribes for the machines to work continuously without idle intervals and the latter for the jobs to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0efa75a1474d699012db0c235f6b80d
https://doi.org/10.1002/nav.3800290311
https://doi.org/10.1002/nav.3800290311
Publikováno v:
European Journal of Operational Research. 18:86-97
A single server dispenses service to m priority classes. The arrival process of the i th class, i = 1, 2,…, m , is homogeneous Poisson. Service times of each class are independent, identical, arbitrarily-distributed random variables with a finite s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7a9d8e4e0622262cbfd789a6271af39
https://doi.org/10.1016/0377-2217(84)90266-2
https://doi.org/10.1016/0377-2217(84)90266-2
Autor:
Uri Yechiali, I. Adiri
Publikováno v:
Operations Research. 22:1051-1066
An M/M/1 service station (computer center) consists of M separate queues. The ith (i = 1, 2, …, M) queue has priority over the jth iff i < j. Upon arrival, a customer receives all the information regarding the state of the system and accordingly ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1eca14d4f39650b08bf78af871c1016f
https://doi.org/10.1287/opre.22.5.1051
https://doi.org/10.1287/opre.22.5.1051
Autor:
I. Adiri, Esther Frostig
Publikováno v:
Communications in Statistics. Stochastic Models. 4:133-149
Consider n jobs and two machines (M1,M2). A job consists of a chain of operations requiring alternately one of the machines. For each job, the number of operations comprised in it, and the machine that the first operation requires, are given. Process
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1dc85a39bb1c045227a92f45d95a9b01
https://doi.org/10.1080/15326348808807074
https://doi.org/10.1080/15326348808807074
Publikováno v:
European Journal of Operational Research. 18:51-56
This paper deals with V-shop scheduling where the route by which a job passes through the machines is: M1 → M2 → ⋯ → Mm−1 → Mm → Mm−1 → ⋯ → M2 → M1. Flowshop scheduling is a special case of V-shop. The two-machine, minimum sch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16203af26c8682b01d736b808c99cf7f
https://doi.org/10.1016/0377-2217(84)90260-1
https://doi.org/10.1016/0377-2217(84)90260-1