Operator assignment problem in aircraft assembly lines: a new planning approach taking into account economic and ergonomic constraints

Similar documents
A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling

Event-based formulations for the RCPSP with production and consumption of resources

Event-based MIP models for the resource constrained project scheduling problem

Valid Inequalities for the Proportional Lotsizing and Scheduling Problem with Fictitious Microperiods. Waldemar Kaczmarczyk

Incorporating Ergonomics Factors into the TSALBP

Multi-Skill Resource-Constrained Project Scheduling: Formulation and Inequalities

HYBRID FLOW-SHOP WITH ADJUSTMENT

Practical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk

Incorporating the Work Pace Concept into the MMSP-W

Duration of online examination will be of 1 Hour 20 minutes (80 minutes).

Application 1 - People Allocation in Line Balancing

Robust optimization for resource-constrained project scheduling with uncertain activity durations

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm

Recoverable Robust Knapsacks: Γ -Scenarios

Time-optimal scheduling for high throughput screening processes using cyclic discrete event models

Planning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA

An Optimization Approach to the Preventive Maintenance Planning Process

Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation

Evaluation of the FSA Hand Force Measurement System

Batch delivery scheduling with simple linear deterioration on a single machine 1

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints

A heuristic algorithm for the Aircraft Landing Problem

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment

Resource Constrained Project Scheduling Linear and Integer Programming (1)

Optimization of Batch Processes

Single Machine Scheduling with a Non-renewable Financial Resource

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints

Bringing Renewables to the Grid. John Dumas Director Wholesale Market Operations ERCOT

Time Aggregation for Network Design to Meet Time-Constrained Demand

A Tighter Analysis of Work Stealing

先進的計算基盤システムシンポジウム SACSIS2012 Symposium on Advanced Computing Systems and Infrastructures SACSIS /5/18 VM 1 VM VM 0-1 1) 18% 50% 2) 3) Matching

A Branch-and-Price Algorithm for Multi-Mode Resource Leveling

An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks

Integer Linear Programming Modeling

Grade 6 Social Studies

Scheduling with Constraint Programming. Job Shop Cumulative Job Shop

Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment

Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem

NP-Completeness. NP-Completeness 1

Single processor scheduling with time restrictions

A Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows

Program Name: PGDBA Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70

LPT rule: Whenever a machine becomes free for assignment, assign that job whose. processing time is the largest among those jobs not yet assigned.

An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse

Integer and Constraint Programming for Batch Annealing Process Planning

Computers and Intractability. The Bandersnatch problem. The Bandersnatch problem. The Bandersnatch problem. A Guide to the Theory of NP-Completeness

Computers and Intractability

A Rough-Cut Capacity Planning Model with Overlapping

Scheduling Lecture 1: Scheduling on One Machine

Decision Diagrams for Discrete Optimization

Basic Scheduling Problems with Raw Material Constraints

Integer Linear Programming (ILP)

On-line scheduling of periodic tasks in RT OS

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013

Embedded Systems Development

Multiprocessor Scheduling of Age Constraint Processes

A Heuristic Method for Job-Shop Scheduling with an Infinite Wait Buffer

Performance Metrics for Computer Systems. CASS 2018 Lavanya Ramapantulu

Using Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling

CS 6901 (Applied Algorithms) Lecture 3

Approximate policy iteration for dynamic resource-constrained project scheduling

Using column generation to solve parallel machine scheduling problems with minmax objective functions

Scheduling Parallel Jobs with Linear Speedup

Classification of Dantzig-Wolfe Reformulations for MIP s

NP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35.

Decomposition Method for Project Scheduling with Spatial Resources

CHAPTER 16: SCHEDULING

A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.

RCPSP Single Machine Problems

A Re-optimization Approach for Train Dispatching

Chapter 3: Discrete Optimization Integer Programming

Computer Method for. Assembly Lines. Lindsay McClintock OPERMGT May 6, 2003

A mathematical model for assembly line balancing model to consider disordering sequence of workstations

What is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.

An improved method for solving micro-ferry scheduling problems

Metode şi Algoritmi de Planificare (MAP) Curs 2 Introducere în problematica planificării

Real-Time Systems. Event-Driven Scheduling

Analysis of test-diagnose-fix strategies for complex manufacturing systems

Revenue Maximization in a Cloud Federation

On Clearing Coupled Day-Ahead Electricity Markets

New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks

Multi-Area Stochastic Unit Commitment for High Wind Penetration

Dynamic Scheduling with Genetic Programming

Lecture 8: Column Generation

Decision Diagrams for Sequencing and Scheduling

Chapter 3: Discrete Optimization Integer Programming

Manufacturing System Flow Analysis

Appendix A Solving Systems of Nonlinear Equations

19. Logic constraints, integer variables

Ordonnancement robuste de réseaux de capteurs sans fil pour le suivi d une cible mobile sous incertitudes

Math 164-1: Optimization Instructor: Alpár R. Mészáros

Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

Aperiodic Task Scheduling

Michael Kupfer. San Jose State University Research Foundation NASA Ames, Moffett Field, CA. 8 th USA Europe ATM Seminar June 29 th July 2 nd Napa, CA

Marjan van den Akker. Han Hoogeveen Jules van Kempen

Coin Changing: Give change using the least number of coins. Greedy Method (Chapter 10.1) Attempt to construct an optimal solution in stages.

Single Machine Scheduling: Comparison of MIP Formulations and Heuristics for. Interfering Job Sets. Ketan Khowala

The resource transfer problem

On Preemptive Scheduling on Uniform Machines to Minimize Mean Flow Time

Traffic Flow Impact (TFI)

Transcription:

Operator assignment problem in aircraft assembly lines: a new planning approach taking into account economic and ergonomic constraints Dmitry Arkhipov, Olga Battaïa, Julien Cegarra, Alexander Lazarev May 12, 2018 D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 1/30

Overview 1 Context & Motivation 2 Operator assignment problem 3 Mathematical model 4 Numerical experiments 5 Conclusion D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 2/30

Overview 1 Context & Motivation 2 Operator assignment problem 3 Mathematical model 4 Numerical experiments 5 Conclusion D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 3/30

Considered problem A brief problem formulation There is an aircraft assembly line. How to schedule assembly tasks and assign them to operators optimally? How to satisfy precedence, resource, time and ergonomic constraints? D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 4/30

RCPSP Resource Constrained Project Scheduling Problem (RCPSP) Considers resources of limited availability and activities of known durations and resource utilization, linked by precedence relations. The problem consists of finding a schedule of minimal duration by assigning a start time to each activity such that the precedence relations and the resource availabilities are respected. The objective is to minimize the project makespan. Complexity The problem is NP-complete in a strong sense (Garey, Johnson 1975). D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 5/30

Industrial motivation Aircraft companies to reduce takt time; to minimize the number of human errors; to improve working conditions. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 6/30

Challenges Operational research very high-dimensional instances; the basic problem (RCPSP) is known to be NP-hard. Ergonomics scoring methods for long work cycles (in contrast to the repetitive environment for other assembly lines e.g. automotive); consideration of cognitive and physical ergonomic factors. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 7/30

Ergonomics Physical ergonomics Loaded body parts: neck, trunk, upper limbs, whole body. Load types: static postures, movements, action forces, strains. Load parameters: duration, force intensity, hand position, Personal factors: age, sex, height. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 8/30

Ergonomics Physical ergonomics evaluation methods D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 9/30

Ergonomics Cognitive ergonomics Type of actions: motor vs cognitive. Worker s personal factors: skill, age, sex. Learning, fatigue and motivation effects. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 10/30

Operator assignment problem D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 11/30

Operator assignment problem Data H planning horizon (takt time); N set of tasks; O set of operators; S set of operator skills, each operator has only one. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 12/30

Operator assignment problem Tasks r j release time; p j processing time; a jx amount of resource x R required to process task j; b js number of operators with skill s S required to process task j. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 13/30

Operator assignment problem Physical ergonomic risks M set of ergonomic risk evaluation methods; erg mj ergonomic score evaluated by method m M for one time unit of task j N; U mo an upper bound on total ergonomic impact for operator o evaluated by method m; D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 14/30

Overview 1 Context & Motivation 2 Operator assignment problem 3 Mathematical model 4 Numerical experiments 5 Conclusion D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 15/30

Constraint programming model for the aggregated demand Decision variables interval j interval variable associated to the execution of task j N, i.e. interval j = [S j, C j ); Objective function The objective is to find a schedule π with the minimal makespan i.e. min max (S π j(π) + p j ). (1) j N D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 16/30

Constraint programming model for the aggregated demand Constraints The task interval size has to be equal to the task processing time, i.e. j N : interval j = p j. (2) Task processing intervals must satisfy the precedence relations with time lags, i.e. e ji E : S j (π) + l ji S i (π). (3) D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 17/30

Constraint programming model for the aggregated demand Resource capacity constraints Resource capacity constraint: F (x, t) = a jx f (interval j, t), (4) j N where f (interval j, t) = 1 if t interval j and f (interval j, t) = 0 otherwise. Then resource capacity constraint can be formulated as x R, t : c x F (x, t). (5) D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 18/30

MIP model for Operator assignment problem Decision variables assign oj binary variable equals to 1 if operator o O assigned on task j N, otherwise assign oj = 0. Objective function The objective function is to minimize the highest ergonomic impact calculated for each pair (m M, o O). min max m M,o O j N assign oj erg mjso (6) D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 19/30

MIP model for Operator assignment problem Constraints For each task j N, the number of operators with skill s S has to be equal to b js j N, s S : o O:s o=s assign oj = b js. (7) The total ergonomic impact of the tasks assigned to the same operator o O measured by method m M has to be less than the defined critical level U mo, i.e. m M, o O : U mo j N erg mjso assign oj. (8) D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 20/30

MIP model for Operator assignment problem Incompatibility constraints Since the schedule of the tasks is known, the incompatible sets E of tasks can be defined, i.e. the sets of the tasks e that cannot be performed by the same operator. e E, o O : j e assign oj 1. (9) D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 21/30

Overview 1 Context & Motivation 2 Operator assignment problem 3 Mathematical model 4 Numerical experiments 5 Conclusion D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 22/30

Numerical experiments Implementation Software: IBM ILOG CPLEX 12.6 Processor: Intel(R) Core(TM) i5-4670 3.40GHz RAM: 16 GB D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 23/30

Numerical experiments Instance 1 289 tasks; 7 operators with 3 skills; 3 ergonomic evaluation methods. Optimal solution found in 18 minutes. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 24/30

Numerical experiments Instance 2 447 tasks; 5 operators with 2 skills; 3 ergonomic evaluation methods. Optimal solution found in 20 minutes. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 25/30

Numerical experiments Gantt chart for the optimal solution for instance 2 D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 26/30

Overview 1 Context & Motivation 2 Operator assignment problem 3 Mathematical model 4 Numerical experiments 5 Conclusion D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 27/30

Conclusion Obtained results Operator assignment problem for aircraft assembly line subject to ergonomic constraints was considered; Constraints programming and Integer linear programming models were developed; Optimal solutions were found for two industrial instances in reasonable time. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 28/30

Conclusion Future perspectives Consideration of cognitive and physical ergonomic factors together. Evaluation of impacts of sequences of tasks. D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 29/30

Thanks! Questions? O. Battaïa olga.battaia@isae.fr D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 30/30