Log in

Relevant bibliographies by topics / Resequencing buffer / Journal articles

To see the other types of publications on this topic, follow the link: Resequencing buffer.

Journal articles on the topic 'Resequencing buffer'

Author: Grafiati

Published: 10 March 2023

Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 18 journal articles for your research on the topic 'Resequencing buffer.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Pechinkin, Alexander, and Rostislav Razumchik. "Estimation of Network Disordering Effects by In-depth Analysis of the Resequencing Buffer Contents in Steady-state." Journal of Telecommunications and Information Technology, no. 1 (March 30, 2016): 53–60. http://dx.doi.org/10.26636/jtit.2016.1.705.

Full text

Abstract:

The paper is devoted to the analytic analysis of resequencing issue, which is common in packet networks, using queueing-theoretic approach. The authors propose the mathematical model, which describes the simplest setting of packet resequencing, but which allows one to make the first step in the in-depth-analysis of the queues dynamics in the resequencing buffer. Specifically consideration is given to N-server queueing system (N > 3) with single infinite capacity buffer and resequencing, which may serve as a model of packet reordering in packet networks. Customers arrive at the system accord

APA, Harvard, Vancouver, ISO, and other styles

2

Farber, Gerrit, Said Salhi, and 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 (June 1, 2008): 69–78. http://dx.doi.org/10.37610/dyo.v0i35.58.

Full text

Abstract:

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 numb

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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 optimizatio

APA, Harvard, Vancouver, ISO, and other styles

4

Rosberg, Z., and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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 reseque

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

Abstract:

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 reseque

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Rosberg, Z., and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Farber, Gerrit, Anna M. Coves Moreno, and 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

16

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

17

Zou, Minmin, Sun Tong, Ting Zou, et al. "A new method for mutation inducing in rice by using DC electrophoresis bath and its mutagenic effects." Scientific Reports 13, no. 1 (2023). http://dx.doi.org/10.1038/s41598-023-33742-7.

Full text

Abstract:

AbstractMutation breeding is a significant means of increasing breeding efficiency and accelerating breeding process. In present study, we explored a new method for mutations inducing in rice (Oryza sativa L.) by using direct current electrophoresis bath (DCEB). The results showed that 20 mM NaCl solution is the optimal buffer, and the mortality of rice seeds followed an upward trend with increasing voltage and processing time of DCEB. By exploring the mutagenic effects of γ-irradiation and DCEB on seed vigor and physiological damages, we found that the physiological damages induced by DCEB on

APA, Harvard, Vancouver, ISO, and other styles

18

Lübben, Malte, Sven Pries, and Celso Gustavo Stall Sikora. "Online resequencing of buffers for automotive assembly lines." Computers & Industrial Engineering, December 2022, 108857. http://dx.doi.org/10.1016/j.cie.2022.108857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!