Process redesign for effective use of product quality information in meat chains

To fulfil segmented consumer demand and add value, meat processors seek to exploit quality differences in meat products. Availability of product quality information is of key importance for this. We present a case study where an innovative sensor technology that provides estimates of an important meat quality feature is considered. Process design scenarios that differ with respect to sorting complexity, available product quality information, and use of temporary buffers are assessed using a discrete event simulation model. Results indicate that increasing sorting complexity by use of advanced product quality information results in a reduction of processing efficiency. Use of production buffers was found to increase processing flexibility and mitigate negative effects of high sorting complexity. This research illustrates how the use of advanced product quality information in logistics’ decision-making affects sorting performance, processing efficiency, and the optimal processing design, an area that has so far received little attention in literature

Effective use of product quality information in meat processing

This paper presents a case study on use of advanced product quality information in meat processing. To serve segmented customer demand meat processors consider use of innovative sensor technology to sort meat products to customer orders. To assess the use of this sensor technology a discrete-event simulation model is built. Various scenarios were defined for processing strategy (buffered or non-buffered), the number of end product groups to sort to and the availability of product quality information. The performance of these scenarios is measured w.r.t. order compliance, labor consumption and throughput-time. Our results reveal that the current processing and product sorting strategy is in-effective for sorting to a large number of end product groups. Furthermore, the current availability of product quality information is insufficient to ensure high levels of order compliance for advanced product quality products

Revstack sort, zigzag patterns, descent polynomials of tt-revstack sortable permutations, and Steingr\'imsson's sorting conjecture

In this paper we examine the sorting operator $T(LnR)=T(R)T(L)n$. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise $t$-revstack sortability in terms of patterns in a permutation that we call $zigzag$ patterns. Using these theorems we characterise those permutations of length $n$ which are sorted by $t$ applications of $T$ for $t=0,1,2,n-3,n-2,n-1$. We derive expressions for the descent polynomials of these six classes of permutations and use this information to prove Steingr\'imsson's sorting conjecture for those six values of $t$. Symmetry and unimodality of the descent polynomials for general $t$-revstack sortable permutations is also proven and three conjectures are given

Comparison and Enhancement of Sorting Algorithms

Some of the primordial issues in computer science is searching, arranging and ordering a list of items or information. Sorting is an important data structure operation, which makes these daunting tasks very easy and helps in searching and arranging the information. A lot of sorting algorithms has been developed to enhance and aggrandize the performance in terms of computational complexity, efficiency, memory, space, speed and other factors. Although there are an enormous number of sorting algorithms, searching and sorting problem has attracted a great deal of research and experimentation; because efficient sorting is important to optimize the use of other algorithms. This paper is an attempt to compare the performance of seven already existing sorting algorithm named as Bubble sort, Merge sort, Quick sort, Heap sort, Insertion sort, Shell sort, Selection sort and to provide an enhancement to these sorting algorithms to make the sorting through these algorithms better. In many cases this enhancement was found faster than the existing algorithms available

An Optimized Input Sorting Algorithm

One of the fundamental issues in compute science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of research, because efficient sorting is important to optimize the use of other algorithms. Sorting involves rearranging information into either ascending or descending order. This paper presents a new sorting algorithm called Input Sort. This new algorithm is analyzed, implemented, tested and compared and results were promising

Information needs after stroke: What to include and how to structure it on a website. A qualitative study using focus groups and card sorting

Background: Use of the Internet to obtain health and other information is increasing. Previous studies have identified the specific information needs of people with stroke but not in relation to the Internet. People with aphasia (PwA) may face barriers in accessing the Internet: Navigating websites requires an ability to categorise information and this ability is often impaired in PwA. The website categorisation preferences of people with stroke and with aphasia have not yet been reported. Aims: This study aimed: (a) to determine what information people who have had a stroke would like to see on a website about living with stroke; (b) to determine the most effective means of structuring information on the website so that it is accessible to people with stroke; and c) to identify any differences between people with and without aphasia in terms of preferences for structuring information on the website. Methods & Procedures: Participants were recruited from a hospital's Stroke Database. Focus groups were used to elicit what information participants wanted on a website about living with stroke. The themes raised were depicted on 133 cards. To determine the most effective way of structuring information on the website, and whether there were any differences in preferences between PwA and PwoA, participants used a modified closed card-sorting technique to sort the cards under website categories. Outcomes & Results: A total of 48 people were invited, and 12 (25%) agreed to take part. We ran three focus groups: one with PwA (n = 5) and two with people without aphasia (PwoA) (n = 3, n = 4). Participants wanted more information about stroke causes and effects (particularly emotional issues), roles of local agencies, and returning to previous activities (driving, going out). All participants completed the card-sorting exercise. Few cards (6%) were categorised identically by everyone. Cards relating to local agencies and groups were not consistently categorised together. Cards relating to emotions were segregated. The categorisation preferences for PwA were more fragmented than those for PwoA: 60% of PwA agreed on the categorisation of 51% of the cards, whereas 60% of PwoA agreed on the categorisation of 76% of the cards. Conclusions: Information needs covered all stages of the stroke journey. The card sorting was accessible to everyone, and provided evidence of structuring preferences and of some of the categorisation difficulties faced by PwA. More research is needed on what an accessible website looks like for PwA

Do Employers Use Unemployment as a Sorting Criterion When Hiring? Evidence from a Field Experiment

In this paper, we use unique data from a field experiment in the Swedish labor market to investigate how past and contemporary unemployment affect a young worker's probability of being invited to a job interview. In contrast to studies using registry/survey data, we have complete control over the information available to the employers and there is no scope for unobserved heterogeneity. We find no evidence that recruiting employers use information about past unemployment to sort workers, but some evidence that they use contemporary unemployment to sort workers. The fact that employers do not seem to use past unemployment as a sorting criterion suggests that the scarring effects of unemployment may not be as severe as has been indicated by previous studies.scarring, unemployment, field experiment