Abstract The paper is motivated by real problems concerning tasks assignment to workers in medium-sized upholstered furniture plants managed using the Demand-Driven Manufacturing. Although methodology was developed for it can be applied other types of production plants. We involve competence coefficients, which describe level worker’s skills or capabilities perform a specific task. coefficients...

The assignment problem is a well-known operations research model. Its various extensions have been applied to the design of distributed computer systems, job assignment in telecommunication networks, and solving diverse location, truck routing and job shop scheduling problems. This paper focuses on a dynamic generalization of the assignment problem where each task consists of a number of units ...

This article presents a software solution to the generalization of Vehicle Routing Problem. The Problem is logistics task, purpose which transport goods and services given place at time in cost-effective manner. Many versions task have developed over years, model constantly changing, complicated systems. details that models general system. representation contains following components: vector de...

The mixed work assignment technique was applied to the modular production concept solve apparel assembly line balancing problem. Specifically, an algorithm implemented generate workstations by first classifying tasks into modules through analysis of manufacturing process and assigning grouped in single task–multiple workers multiple tasks–single worker methods. Then, sequentially performed cons...

time-delays are important components of many dynamical systems that describe coupling or interconnection between dynamics, propagation or transport phenomena, and heredity and competition in population dynamics. the stabilization with time delay in observation or control represents difficult mathematical challenges in the control of distributed parameter systems. it is well-known that the stabi...

This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...

In recent years, there has been considerable interest within the tracking community in an approach to data association based on the m-best two-dimensional (2-D) assignment algorithm. Much of the interest has been spurred by its ability to provide various efficient data association solutions, including joint probabilistic data association (JPDA) and multiple hypothesis tracking (MHT). The focus ...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...