Relevant bibliographies by topics / Resequencing buffer / Journal articles

Journal articles on the topic 'Resequencing buffer'

To see the other types of publications on this topic, follow the link: Resequencing buffer.
Author: Grafiati
Published: 10 March 2023

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

Select a source type:

Consult the top 16 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

CHAKRAVARTHY, SRINIVAS R., and STEFANKA CHUKOVA. "A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS." Asia-Pacific Journal of Operational Research 22, no. 03 (September 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 optimization problems along with illustrative numerical examples are discussed.
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 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.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

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 (July 2011): 272–77. http://dx.doi.org/10.1016/j.orl.2011.04.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xu, Susan H. "On a job resequencing issue in parallel processor stochastic scheduling." Advances in Applied Probability 24, no. 4 (December 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 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.
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. 04 (December 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 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.
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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 (January 1998): 211–28. http://dx.doi.org/10.1016/s0166-5316(96)00067-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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 (April 1994): 353–66. http://dx.doi.org/10.1016/0166-5316(94)90047-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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 (September 2016): 2897–912. http://dx.doi.org/10.1080/00207543.2016.1227101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

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
12

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

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
14

Akgun, Osman T., Rhonda Righter, and Ronald Wolff. "Multiple-server system with flexible arrivals." Advances in Applied Probability 43, no. 4 (December 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 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.
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. 04 (December 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 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.
APA, Harvard, Vancouver, ISO, and other styles
16

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!

To the bibliography