An optimal worker allocation problem for a U-shaped production line

Nakade, Koichi; Ohno, Katsuhisa

doi:10.1016/s0925-5273(98)00145-5

Cited by 57 publications

(22 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The most frequently considered criterion is to minimize the line takt time, see Miralles et al (2008), Blum and Miralles (2011), Moreira and Costa (2013) and Mutlu et al (2013). Most of the publications on workforce assignment or workforce planning assume that workers have different skills, which influence task processing times and hence the line productivity; see, for example, Nakade and Ohno (1999), Miralles et al (2007), Niemi (2009), Araújo et al (2012), Othman et al (2012), Fowler et al (2008) and Costa and Miralles (2009).…”

Section: Overall Statement Of the Problem And Related Literaturementioning

confidence: 99%

Workforce minimization for a mixed-model assembly line in the automotive industry

Battaïa

Delorme

Dolgui

et al. 2015

International Journal of Production Economics

View full text Add to dashboard Cite

International audienceA paced assembly line consisting of several workstations is considered. This line is intended to assemble products of different types. The sequence of products is given. The sequence of technological tasks is common for all types of products. The assignment of tasks to the stations and task sequence on each station are known and cannot be modified, and they do not depend on the product type. Tasks assigned to the same station are performed sequentially. The processing time of a task depends on the number of workers performing this task. Workers are identical and versatile. If a worker is assigned to a task, he/she works on this task from its start till completion. Workers can switch between the stations at the end of each task and the time needed by any worker to move from one station to another one can be neglected. At the line design stage, it is necessary to know how many workers are necessary for the line. To know the response to this question we will consider each possible takt and assign workers to tasks so that the total number of workers is minimized, provided that a given takt time is satisfied. The maximum of minimal numbers of workers for all takts will be considered as the necessary number of workers for the line. Thus, the problem is to assign workers to tasks for a takt. We prove that this problem is NP-hard in the strong sense, we develop an integer linear programming formulation to solve it, and propose conventional and randomized heuristics

show abstract

Section: Overall Statement Of the Problem And Related Literaturementioning

confidence: 99%

Workforce minimization for a mixed-model assembly line in the automotive industry

Battaïa

Delorme

Dolgui

et al. 2015

International Journal of Production Economics

View full text Add to dashboard Cite

show abstract

“…These realistic side conditions can find applications in many areas, such as multiple traveling salesman problem [15], vehicle routing problems [16,17], and staff/crew scheduling problems [18][19][20][21][22][23]. The single depot multiple traveling salesman problem (mTSP), in which m salesmen starting from the single depot node have to visit exactly once each intermediate node in a given list and in the end have to return to depot node in such a way that the total time (distance) traveled is minimum, is closely related to topic of this paper.…”

Section: Problem Statementmentioning

confidence: 99%

“…The total cycle time C of service personnel in planning period is ∑ j (d j + t ij' ), and if this exceeds the service response time it is necessary to allocate a second service person. To determine the lower bound on quantity of service personnel, we use the approach of Nakade and Ohno (1999) [ ]…”

Section: Solution Approachmentioning

confidence: 99%

An Optimization Model for Scheduling Tour of Service Personnel in afterSale Service Process with Additional Side Conditions of Responsiveness and FCFS Service Policy

Choudhary¹

2015

Ind Eng Manage

View full text Add to dashboard Cite

In this paper a binary integer linear programming model is proposed for scheduling tour of service personnel in aftersale service process. The model aims to minimize the service personnel's overall travel time of visiting all customers with additional side conditions that customers should be served by first come first serve (FCFS) priority basis within specified service response time. These side conditions are important strategies in present era of time-based competition. The objective and side conditions are considered for both profitability and effectiveness. Indeed, for given service response time, optimal tour plan would minimize the quantity of service personnel. This decreases the hiring cost of service personnel and thus increases the profitability of after-sale service process. On the other hand, for given quantity of service personnel, optimal tour plan would reduce the service response time. Responsive after-sale service on FCFS priority basis will increase the customer satisfaction, which in turn leads to more repeat orders and hence improves the profitability. The proposed model can capture all realistic constraints of service management process, such as time windows, skill requirement, balanced workload distribution, etc. A numerical illustration is included to demonstrate the effectiveness of the proposed model in conducting economic analysis of an after-sale service process.

show abstract

“…In the U-type assembly line literature, there are a number of test problems used by several researchers (Scholl and Klein, 1999 classify these problems into three data sets: Talbot et al, 1986;Hoffmann, 1990Hoffmann, , 1992Scholl, 1993). These data sets are available at: Wee-mag (75 tasks, C = 28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,45,46,47,49,50,52,54,56);…”

Section: Cycle Time (C) Task Processing Times (T) and Number Of Taskmentioning

confidence: 99%

Ant colony optimization for the single model U-type assembly line balancing problem

Sabuncuoğlu

Erel

Alp

2009

International Journal of Production Economics

View full text Add to dashboard Cite

The assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is the allocation of tasks to an ordered sequence of stations subject to the precedence constraints with the objective of minimizing the number of stations. In a U-line the line is configured into a U-shape topology.In this research, a new heuristic, Ant Colony Optimization (ACO) meta-heuristic, and its variants are proposed for the single model U-type assembly line balancing problem (UALBP). We develop a number of algorithms that can be grouped as:(i) direct methods, (ii) modified methods and (iii) methods in which ACO approach is augmented with some metaheuristic.We also construct an extensive experimental study and compare the performance of the proposed algorithms against the procedures reported in the literature. Ayrıca kapsamlı bir deneysel çalışma yapılmış ve önerilen algoritmaların performansı literatürdeki diğer metodlarla karşılaştırılmıştır.Anahtar sözcükler: U-tipi montaj hattı dengelenmesi problemi, Karınca KolonisiOptimizasyonu meta-sezgiseli.iv

show abstract

An optimal worker allocation problem for a U-shaped production line

Cited by 57 publications

References 2 publications

Workforce minimization for a mixed-model assembly line in the automotive industry

Workforce minimization for a mixed-model assembly line in the automotive industry

An Optimization Model for Scheduling Tour of Service Personnel in afterSale Service Process with Additional Side Conditions of Responsiveness and FCFS Service Policy

Ant colony optimization for the single model U-type assembly line balancing problem

Contact Info

Product

Resources

About