Bibliographies thématiques / Resequencing buffer / Articles de revues
Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Resequencing buffer.

Articles de revues sur le sujet « Resequencing buffer »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 16 meilleurs articles de revues pour votre recherche sur le sujet « Resequencing buffer ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

CHAKRAVARTHY, SRINIVAS R., et STEFANKA CHUKOVA. « A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS ». Asia-Pacific Journal of Operational Research 22, no 03 (septembre 2005) : 409–43. http://dx.doi.org/10.1142/s0217595905000613.

Texte intégral
Résumé :
In this paper, we consider a two-server finite capacity queuing model in which messages should leave the system in the order in which they entered the system. Messages arrive according to a Markovian arrival process (MAP) and any message finding the buffer full is considered lost. Out-of-sequence messages are stored in a (finite) buffer and may lead to blocking when a processed message cannot be placed in the buffer. The steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. The departure process is characterized and two interesting optimization problems along with illustrative numerical examples are discussed.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Farber, Gerrit, Said Salhi et Anna M. Coves Moreno. « SEQUENCING IN A NON-PERMUTATION FLOWSHOP WITH CONSTRAINED BUFFERS : APPLICABILITY OF GENETIC ALGORITH VERSUS CONSTRAINT LOGIC PROGRAMMING ». Dirección y Organización, no 35 (1 juin 2008) : 69–78. http://dx.doi.org/10.37610/dyo.v0i35.58.

Texte intégral
Résumé :
Mixed model production lines consider more than one model being processed on the same production line in an arbitrary sequence. Nevertheless, the majority of publications in this area are limited to solutions which determine the job sequence before the jobs enter the line and maintains it without interchanging jobs until the end of the production line, which is known as permutation flowshop. This paper considers a nonpermutation flowshop. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. Two conceptually different approaches are presented in order to solve the problem. The first approach is a hybrid approach, using Constraint Logic Programming (CLP), whereas the second one is a Genetic Algorithm (GA). Improvements that come with the introduction of constrained resequencing buffers are highlighted. Characteristics such as the difference between the intermediate and the centralized case are analyzed, and the special case of semi dynamic demand is studied. Finally, recommendations are presented for the applicability of the hybrid approach, using CLP, versus the Genetic Algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Rosberg, Z., et N. Shacham. « Resequencing delay and buffer occupancy under the selective-repeat ARQ ». IEEE Transactions on Information Theory 35, no 1 (1989) : 166–73. http://dx.doi.org/10.1109/18.42186.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bae, Yun Han, Bara Kim, Bong Dae Choi et Jeongsim Kim. « Tail asymptotic behaviour of resequencing buffer content for selective repeat ARQ ». Operations Research Letters 39, no 4 (juillet 2011) : 272–77. http://dx.doi.org/10.1016/j.orl.2011.04.009.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Xu, Susan H. « On a job resequencing issue in parallel processor stochastic scheduling ». Advances in Applied Probability 24, no 4 (décembre 1992) : 915–33. http://dx.doi.org/10.2307/1427719.

Texte intégral
Résumé :
In flexible assembly systems, it is often necessary to coordinate jobs and materials so that specific jobs are matched with specific materials. This requires that jobs depart from upstream parallel workstations in some predetermined order. One way to satisfy this requirement is to temporarily hold the serviced jobs getting out of order at a resequencing buffer and to release them to downstream workstations as soon as all their predecessors are serviced. In this paper we consider the problem of scheduling a fixed number of non-preemptive jobs on two IHR non-identical processors with the resequencing requirement. We prove that the individually optimal policy, in which each job minimizes its own expected departure time subject to the constraint that available processors are offered to jobs in their departure order, is of a threshold type. The policy is independent of job weights and the jobs residing at the resequencing buffer and possesses the monotonicity property which states that a job will never utilize a processor in the future once it has declined the processor. Most importantly, we prove that the individually optimal policy has the stability property; namely: if at any time a job deviated from the individually optimal policy, then the departure time of every job, including its own, would be prolonged. As a direct consequence of this property, the individually optimal policy is socially optimal in the sense that it minimizes the expected total weighted departure time of the system as a whole. We identify situations under which the individually optimal policy also minimizes the expected makespan of the system.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Xu, Susan H. « On a job resequencing issue in parallel processor stochastic scheduling ». Advances in Applied Probability 24, no 04 (décembre 1992) : 915–33. http://dx.doi.org/10.1017/s0001867800025015.

Texte intégral
Résumé :
In flexible assembly systems, it is often necessary to coordinate jobs and materials so that specific jobs are matched with specific materials. This requires that jobs depart from upstream parallel workstations in some predetermined order. One way to satisfy this requirement is to temporarily hold the serviced jobs getting out of order at a resequencing buffer and to release them to downstream workstations as soon as all their predecessors are serviced. In this paper we consider the problem of scheduling a fixed number of non-preemptive jobs on two IHR non-identical processors with the resequencing requirement. We prove that the individually optimal policy, in which each job minimizes its own expected departure time subject to the constraint that available processors are offered to jobs in their departure order, is of a threshold type. The policy is independent of job weights and the jobs residing at the resequencing buffer and possesses the monotonicity property which states that a job will never utilize a processor in the future once it has declined the processor. Most importantly, we prove that the individually optimal policy has the stability property; namely: if at any time a job deviated from the individually optimal policy, then the departure time of every job, including its own, would be prolonged. As a direct consequence of this property, the individually optimal policy is socially optimal in the sense that it minimizes the expected total weighted departure time of the system as a whole. We identify situations under which the individually optimal policy also minimizes the expected makespan of the system.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Shacham, N., et D. Towsley. « Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers ». IEEE Transactions on Communications 39, no 6 (juin 1991) : 928–37. http://dx.doi.org/10.1109/26.87182.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Chakravarthy, S., S. Chukova et B. Dimitrov. « Analysis of MAP/M/2/K queueing model with infinite resequencing buffer ». Performance Evaluation 31, no 3-4 (janvier 1998) : 211–28. http://dx.doi.org/10.1016/s0166-5316(96)00067-3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Takine, Tetsuya, Jing-Fei ren et Toshiharu Hasegawa. « Analysis of the resequencing buffer in a homogeneous M/M/2 queue ». Performance Evaluation 19, no 4 (avril 1994) : 353–66. http://dx.doi.org/10.1016/0166-5316(94)90047-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Gunay, Elif Elcin, et Ufuk Kula. « A stochastic programming model for resequencing buffer content optimisation in mixed-model assembly lines ». International Journal of Production Research 55, no 10 (septembre 2016) : 2897–912. http://dx.doi.org/10.1080/00207543.2016.1227101.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
11

Rosberg, Z., et M. Sidi. « Selective-repeat ARQ : the joint distribution of the transmitter and the receiver resequencing buffer occupancies ». IEEE Transactions on Communications 38, no 9 (1990) : 1430–38. http://dx.doi.org/10.1109/26.61384.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Iliadis, Ilias, et Wolfgang E. Denzel. « Resequencing Worst-Case Analysis for Parallel Buffered Packet Switches ». IEEE Transactions on Communications 55, no 3 (mars 2007) : 605–17. http://dx.doi.org/10.1109/tcomm.2007.892460.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
13

Farber, Gerrit, Anna M. Coves Moreno et Said Salhi. « Performance evaluation of hybrid-CLP vs. GA : non-permutation flowshop with constrained resequencing buffers ». International Journal of Manufacturing Technology and Management 20, no 1/2/3/4 (2010) : 242. http://dx.doi.org/10.1504/ijmtm.2010.032900.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
14

Akgun, Osman T., Rhonda Righter et Ronald Wolff. « Multiple-server system with flexible arrivals ». Advances in Applied Probability 43, no 4 (décembre 2011) : 985–1004. http://dx.doi.org/10.1239/aap/1324045695.

Texte intégral
Résumé :
In many service, production, and traffic systems there are multiple types of customers requiring different types of ‘servers’, i.e. different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e. they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We generalize earlier results on the optimality of ‘join the shortest queue’ (JSQ) for flexible arrivals to the following: arbitrary arrivals where only a subset are flexible, multiple-server stations, and abandonments. Surprisingly, with abandonments, the optimality of JSQ for minimizing the number of customers in the system depends on the relative abandonment and service rates. We extend our model to finite buffers and resequencing. We assume exponential service. Our optimality results are very strong; we minimize the queue length process in the weak majorization sense.
Styles APA, Harvard, Vancouver, ISO, etc.
15

Akgun, Osman T., Rhonda Righter et Ronald Wolff. « Multiple-server system with flexible arrivals ». Advances in Applied Probability 43, no 04 (décembre 2011) : 985–1004. http://dx.doi.org/10.1017/s0001867800005267.

Texte intégral
Résumé :
In many service, production, and traffic systems there are multiple types of customers requiring different types of ‘servers’, i.e. different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e. they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We generalize earlier results on the optimality of ‘join the shortest queue’ (JSQ) for flexible arrivals to the following: arbitrary arrivals where only a subset are flexible, multiple-server stations, and abandonments. Surprisingly, with abandonments, the optimality of JSQ for minimizing the number of customers in the system depends on the relative abandonment and service rates. We extend our model to finite buffers and resequencing. We assume exponential service. Our optimality results are very strong; we minimize the queue length process in the weak majorization sense.
Styles APA, Harvard, Vancouver, ISO, etc.
16

Lübben, Malte, Sven Pries et Celso Gustavo Stall Sikora. « Online resequencing of buffers for automotive assembly lines ». Computers & ; Industrial Engineering, décembre 2022, 108857. http://dx.doi.org/10.1016/j.cie.2022.108857.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie