1,722,274 research outputs found
A Sociolinguistic Assessment of the Roshani Speech Variety in Afghanistan
Full text linkThis paper presents the results of a sociolinguistic assessment conducted in September 2007 in the Roshan area in Afghanistan, where the vernacular Roshani is spoken (ISO: sgh, for Shughni). The goal of the assessment was to determine whether the Roshani people will benefit from a language development project, opening the possibility for literature development and primary school education in the vernacular. The objectives were to assess whether the national language Dari (ISO: prs, for Persian) or the closely related speech variety Shughni would be adequate to be used in literature and primary school education. This was achieved by administering sociolinguistic questionnaires and village elder questionnaires, eliciting word lists, testing intelligibility of the Shughni speech variety, and observing and asking about bilingualism with Dari. In this way the domains of language use, attitude towards Roshani, Shughni and Dari, and bilingualism with Dari, and intelligibility of Shughni were determined. This paper aims to show that due to low bilingualism with Dari, Dari literature cannot serve the Roshani speech community adequately. Because of high intelligibility with Shughni and a neutral attitude, it will be recommendable that Shughni reading material will be tested in Roshan as soon as it is ready.National Foreign Language Resource Cente
Roshani goel's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Roshani goel's Quick Files
No full textThe Quick Files feature was discontinued and it’s files were migrated into this Project on March 11, 2022. The file URL’s will still resolve properly, and the Quick Files logs are available in the Project’s Recent Activity
Buku ajar akuntansi accurate
No full textBuku Ajar Akuntansi Accurate karya Eliza Noviriani dan Roshani merupakan panduan praktis dalam memahami dan mengaplikasikan Accurate Online, sebuah platform akuntansi berbasis cloud yang dirancang untuk membantu pengelolaan keuangan bisnis secara efektif dan efisien
A simulated annealing approach for multi-manned assembly line balancing problem type II
No full textMulti-manned assembly lines are often designed to produce large-sized products, such as automobiles, trucks and buses. In this type of production lines, usually there are multimanned workstations where a group of workers simultaneously performs different operations on the same individual product. One of the problems, that managers of such production lines usually encounter, is to produce the optimal number of items using a fixed number of workstations, without adding new ones in order to meet the market demand. In this paper, such a class of assembly line balancing problems, named multi-manned assembly line balancing problems type II, has been addressed. Since the problem is NP-hard, a meta-heuristic approach based on a simulated annealing algorithm has been developed to solve the problem. The performance of the proposed algorithm has been tested on a set of test problems taken from the literature; the results show that the algorithm performs well
A Mathematical Programming Formulation for Cost-oriented Multi-manned Assembly Line Balancing Problem
No full textMulti-manned assembly line balancing problems are usually occurred in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost- oriented objective function is presented for a multi-manned assembly line balancing problem. This kind of objective function may be used to balance final assembly lines of products in which manufacturing process is very labor intensive. A mixed-integer mathematical programming model is proposed to solve the problem optimally. The proposed formulation has been used to solve some small size problems by considering both time-oriented and cost-oriented objective functions. The experiments show that, given the same precedence graph of multi-manned assembly line with a same cycle time, two different optimal solutions can be actually found when switching from time-oriented to cost-oriented objective functions, and vice versa. This difficulty increases the complexity of the cost-oriented multi-manned assembly line balancing problems with respect to the multi-manned assembly line balancing problems addressed in the literature
A tabu search algorithm for the cost-oriented multi-manned Assembly Line Balancing Problem
No full textPlants manufacturing large-sized high-volume products, such as automobiles and trucks, usually encounter Multi-manned Assembly Line Balancing Problems (MALBPs). In this paper, a cost-oriented version of MALBPs, namely CMALBP, is taken into account. These types of problems may arise in the final assembly lines of products in which the manufacturing process is pretty labor-intensive. Since CMALBP is NP-Hard, a heuristic approach based on a Tabu search algorithm is developed to solve the problem. The proposed algorithm uses two neighborhood generation mechanisms, namely swap and mutation, which effectively collaborate with each other to provide new feasible solutions. Moreover, two separate tabu lists (corresponding with the two mentioned generation mechanisms) are used to check whether or not moving to a new generated neighbor solution is forbidden. To examine the efficiency of the proposed algorithm, some experimental instances were collected from the literature and solved. The obtained results show the effectiveness of the proposed tabu search approach
Simulated annealing algorithms for the multi-manned assembly line balancing problem: minimising cycle time
No full textMulti-manned assembly lines are often designed to produce big-sized products, such as automobiles and trucks. In this type of production lines, there are multi-manned workstations where a group of workers simultaneously performs different operations on the same individual product. One of the problems, that managers of such production lines usually encounter, is to produce the optimal number of items using a fixed number of workstations, without adding new ones. In this paper, such a class of problems, namely, the multi-manned assembly line balancing problem is addressed, with the objective of minimising the cycle time. A mixed-integer mathematical programming formulation is proposed for the considered problem. This model has the primary objective of minimising the cycle time for a given number of workstations and the secondary objective of minimising the total number of workers. Since the addressed problem is NP-hard, two meta-heuristic approaches based on the simulated annealing algorithm have been developed: ISA and DSA. ISA solves the problem indirectly while DSA solves it directly. The performance of the two algorithms are tested and compared on a set of test problems taken from the literature. The results show that DSA outperforms ISA in term of solution quality and computational time
Integrated lot sizing and energy-efficient job shop scheduling problem in manufacturing/remanufacturing systems
No full textIn this paper, a system designed to produce multi-class single-level products through both manufacturing of raw materials and remanufacturing of return products is taken into consideration, with the aim of defining and solving an integrated lot sizing and energy-efficient job shop scheduling problem. A mixed-integer programming formulation is proposed for the problem. This model minimizes not only the manufacturing and remanufacturing costs, the setup cost and the inventory holding and backlogging costs over the planning horizon, but also the energy costs paid for the utilization of machines and the compression of processing times. Since the model is NP-hard, a relax-and-fix heuristic is proposed to solve the problem. The proposed algorithm is illustrated with a numerical example, and its performance is tested on a set of randomly generated experimental problems. The results show the efficiency of the algorithm. Besides, the performance of the proposed energy-efficient model has been compared with classical models (that consider only the minimization of manufacturing/remanufacturing, holding and setup costs); the results indicate that the proposed model not only diminishes the energy consumption and the machines idle times, but it actually reduces the overall cost of the system
A relax-and-fix heuristic approach for the capacitated dynamic lot sizing problem in integrated manufacturing/remanufacturing systems
No full textIn this paper, the capacitated dynamic lot sizing problem in integrated manufac-turing/remanufacturing systems is addressed. These kinds of production systems are designed to satisfy the demands of different classes of single-level products not only by manufacturing raw materials, but also by remanufacturing returned products. A single machine with a limited capacity in each time period is used to perform both the manufacturing and remanufacturing operations. A mathematical programming formulation is proposed to optimally solve this problem. Since the problem is NP-hard (it is a generalized version of the classical capacitated dynamic lot sizing problem), a relax-and-fix heuristic is developed to solve the problem in a reasonable amount of time. To evaluate the efficiency of the proposed algorithm, some experimental instances are generated and solved. The obtained results show the effectiveness of the proposed algorithm
- …
