In this paper we consider the programming of job rotation in the Assembly Line Worker Assignment and Balancing Problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We pr...

Many important problems in engineering management can be formulated as Resource Assignment Problem (RAP). The Workers (WAP) is considered a sub-class of RAP which aims to find an optimal assignment workers number tasks order optimize certain objectives. WAP NP-hard combinatorial optimization problem. Due its importance, several algorithms have been developed solve it. In this paper, it that man...

Two auditory feedback perturbation experiments were conducted to examine the nature of control of the first two formants in vowels. In the first experiment, talkers heard their auditory feedback with either F1 or F2 shifted in frequency. Talkers altered production of the perturbed formant by changing its frequency in the opposite direction to the perturbation but did not produce a correlated al...

Virtual cellular manufacturing systems (VCMS) have come into existence, replacing traditional cellular manufacturing systems (CMS), to meet highly dynamic production conditions in terms of demand, processing times, product mix and processing sequence. While cell formation phase of VCMS has been dealt quite voluminously, worker assignments phase has gained momentum recently after researchers sta...

This paper uses the Kaldor-Hicks compensation principle to compute the present value (PV) of a non-marginal future event. Three theoretical results stand out: first, decreasing returns to capital create a wedge between the PV of future generations’ willingness to pay (WTP) and the PV of their willingness to accept compensation (WTA); second, the discount rates implicit in the computation of the...

Certain types of manufacturing processes can be modelled by assembly line balancing problems. In this work we deal with a specific assembly line balancing problem that is know as the assembly line worker assignment and balancing problem (ALWABP). This problem appears in settings where tasks must be assigned to workers, and workers to work stations. Task processing times are worker specific, and...

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

Evaluating worker’s suitability for a job is an important tool for Human Resources Managers (HRMs) to select the better candidates under various evaluation criteria. A problem of workers' assignment is studied in this paper in order to find the best assignment of workers to vacancies ensuring assigning a specified worker in a specified job. The objectives might be minimizing the total time to c...

It was recently demonstrated that a well-known eigenvalue bound for the Quadratic Assignment Problem (QAP) actually corresponds to a semideenite programming (SDP) relaxation. However, for this bound to be computationally useful the assignment constraints of the QAP must rst be eliminated, and the bound then applied to a lower-dimensional problem. The resulting \projected eigenvalue bound" is on...