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

Size: px
Start display at page:

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

Transcription

1 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

2 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

3 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

4 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

5 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

6 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

7 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

8 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

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

10 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

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

12 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

13 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

14 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

15 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

16 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

17 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

18 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

19 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

20 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

21 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

22 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

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

24 Numerical experiments Instance 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

25 Numerical experiments Instance 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

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

27 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

28 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

29 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

30 Thanks! Questions? O. Battaïa D. Arkhipov, O. Battaïa, J. Cegarra, A. Lazarev 30/30

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

A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling Department of Mathematics, Linköping University Jessika Boberg LiTH-MAT-EX 2017/18 SE Credits: Level:

More information

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

Event-based formulations for the RCPSP with production and consumption of resources Event-based formulations for the RCPSP with production and consumption of resources Oumar KONE 1, Christian ARTIGUES 1, Pierre LOPEZ 1, and Marcel MONGEAU 2 May 2010 1: CNRS ; LAAS ; 7 avenue du colonel

More information

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

Event-based MIP models for the resource constrained project scheduling problem Event-based MIP models for the resource constrained project scheduling problem Oumar Koné, Christian Artigues, Pierre Lopez LAAS-CNRS, Université de Toulouse, France Marcel Mongeau IMT, Université de Toulouse,

More information

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

Valid Inequalities for the Proportional Lotsizing and Scheduling Problem with Fictitious Microperiods. Waldemar Kaczmarczyk Valid Inequalities for the Proportional Lotsizing and Scheduling Problem with Fictitious Microperiods Waldemar Kaczmarczyk Department of Operations Research AGH University of Science and Technology Kraków,

More information

Incorporating Ergonomics Factors into the TSALBP

Incorporating Ergonomics Factors into the TSALBP Incorporating Ergonomics Factors into the TSALBP Joaquín Bautista, Cristina Batalla, and Rocío Alfaro Universitat Politècnica de Catalunya, Avda. Diagonal 647, 7th floor, 08028 Barcelona, Spain {joaquin.bautista,cristina.batalla,rocio.alfaro}@upc.edu

More information

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

Multi-Skill Resource-Constrained Project Scheduling: Formulation and Inequalities Multi-Skill Resource-Constrained Project Scheduling: Formulation and Inequalities Isabel Correia, Lídia Lampreia Lourenço and Francisco Saldanha-da-Gama CIO Working Paper 17/2008 Multi-Skill Resource-Constrained

More information

HYBRID FLOW-SHOP WITH ADJUSTMENT

HYBRID FLOW-SHOP WITH ADJUSTMENT K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 50 59 HYBRID FLOW-SHOP WITH ADJUSTMENT Jan Pelikán The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering

More information

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

Practical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk Decision Making in Manufacturing and Services Vol. 3 2009 No. 1 2 pp. 37 48 Practical Tips for Modelling Lot-Sizing and Scheduling Problems Waldemar Kaczmarczyk Abstract. This paper presents some important

More information

Incorporating the Work Pace Concept into the MMSP-W

Incorporating the Work Pace Concept into the MMSP-W Incorporating the Work Pace Concept into the MMSP-W Bautista J 1, Alfaro R 2, Batalla C 3, Cano A 4 Abstract This work proposes an extension for the MMSP-W (Mixed-Model Sequencing Problem with Work overload

More information

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

Duration of online examination will be of 1 Hour 20 minutes (80 minutes). Program Name: SC Subject: Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70 Duration: 80 mins Online Examination: Online examination is a Computer based examination.

More information

Application 1 - People Allocation in Line Balancing

Application 1 - People Allocation in Line Balancing Chapter 9 Workforce Planning Introduction to Lecture This chapter presents some applications of Operations Research models in workforce planning. Work force planning would be more of a generic application

More information

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

Robust optimization for resource-constrained project scheduling with uncertain activity durations Robust optimization for resource-constrained project scheduling with uncertain activity durations Christian Artigues 1, Roel Leus 2 and Fabrice Talla Nobibon 2 1 LAAS-CNRS, Université de Toulouse, France

More information

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

Real-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should

More information

Recoverable Robust Knapsacks: Γ -Scenarios

Recoverable Robust Knapsacks: Γ -Scenarios Recoverable Robust Knapsacks: Γ -Scenarios Christina Büsing, Arie M. C. A. Koster, and Manuel Kutschka Abstract In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty

More information

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

Time-optimal scheduling for high throughput screening processes using cyclic discrete event models Mathematics and Computers in Simulation 66 2004 181 191 ime-optimal scheduling for high throughput screening processes using cyclic discrete event models E. Mayer a,, J. Raisch a,b a Fachgruppe System

More information

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

Planning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA Planning and Scheduling of batch processes Prof. Cesar de Prada ISA-UVA prada@autom.uva.es Outline Batch processes and batch plants Basic concepts of scheduling How to formulate scheduling problems Solution

More information

An Optimization Approach to the Preventive Maintenance Planning Process

An Optimization Approach to the Preventive Maintenance Planning Process Modern Applied Science; Vol. 11, No. 9; 2017 ISSN 1913-1844 E-ISSN 1913-1852 Published by Canadian Center of Science and Education An Optimization Approach to the Preventive Maintenance Planning Process

More information

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

Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation Computers and Chemical Engineering (00) Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation D. Wu, M. Ierapetritou Department of Chemical and Biochemical Engineering,

More information

Evaluation of the FSA Hand Force Measurement System

Evaluation of the FSA Hand Force Measurement System Evaluation of the FSA Hand Force Measurement System Kihyo Jung, Heecheon You, and Ochae Kwon Ergonomic Design Technology Lab Department of Industrial & Management Engineering Pohang University of Science

More information

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

Batch delivery scheduling with simple linear deterioration on a single machine 1 Acta Technica 61, No. 4A/2016, 281 290 c 2017 Institute of Thermomechanics CAS, v.v.i. Batch delivery scheduling with simple linear deterioration on a single machine 1 Juan Zou 2,3 Abstract. Several single

More information

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Presenter: Tong Shu Authors: Tong Shu and Prof. Chase Q. Wu Big Data Center Department of Computer Science New Jersey Institute

More information

A heuristic algorithm for the Aircraft Landing Problem

A heuristic algorithm for the Aircraft Landing Problem 22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 A heuristic algorithm for the Aircraft Landing Problem Amir Salehipour

More information

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

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment Journal of Optimization in Industrial Engineering 15 (2014) 47-53 Exact ixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment ohammad Saidi mehrabad a, Saeed Zarghami

More information

Resource Constrained Project Scheduling Linear and Integer Programming (1)

Resource Constrained Project Scheduling Linear and Integer Programming (1) DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern

More information

Optimization of Batch Processes

Optimization of Batch Processes Integrated Scheduling and Dynamic Optimization of Batch Processes Yisu Nie and Lorenz T. Biegler Center for Advanced Process Decision-making Department of Chemical Engineering Carnegie Mellon University

More information

Single Machine Scheduling with a Non-renewable Financial Resource

Single Machine Scheduling with a Non-renewable Financial Resource Single Machine Scheduling with a Non-renewable Financial Resource Evgeny R. Gafarov a, Alexander A. Lazarev b Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya st. 65, 117997

More information

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

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Keqin Li Department of Computer Science State University of New York New Paltz, New

More information

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

Bringing Renewables to the Grid. John Dumas Director Wholesale Market Operations ERCOT Bringing Renewables to the Grid John Dumas Director Wholesale Market Operations ERCOT 2011 Summer Seminar August 2, 2011 Quick Overview of ERCOT The ERCOT Market covers ~85% of Texas overall power usage

More information

Time Aggregation for Network Design to Meet Time-Constrained Demand

Time Aggregation for Network Design to Meet Time-Constrained Demand 20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 Time Aggregation for Network Design to Meet Time-Constrained Demand N. Boland

More information

A Tighter Analysis of Work Stealing

A Tighter Analysis of Work Stealing A Tighter Analysis of Work Stealing Marc Tchiboukdjian Nicolas Gast Denis Trystram Jean-Louis Roch Julien Bernard Laboratoire d Informatique de Grenoble INRIA Marc Tchiboukdjian A Tighter Analysis of Work

More information

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

先進的計算基盤システムシンポジウム SACSIS2012 Symposium on Advanced Computing Systems and Infrastructures SACSIS /5/18 VM 1 VM VM 0-1 1) 18% 50% 2) 3) Matching VM 1 VM VM 0-1 1) 18% 50% 2) 3) Matching-based Virtual Machine Packing Algorithm for Lower Power Consumption SATOSHI TAKAHASHI, ATSUKO TAKEFUSA, MAIKO SHIGENO, HIDEMOTO NAKADA, TOMOHIRO KUDOH and AKIKO

More information

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

A Branch-and-Price Algorithm for Multi-Mode Resource Leveling A Branch-and-Price Algorithm for Multi-Mode Resource Leveling Eamonn T. Coughlan 1, Marco E. Lübbecke 2, and Jens Schulz 1 1 Technische Universität Berlin, Institut für Mathematik, Straße d. 17. Juni 136,

More information

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

An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks Sandeep Kumar Bijinemula *, Aaron Willcock, Thidapat Chantem *, Nathan Fisher * Department of Electrical and Computer

More information

Integer Linear Programming Modeling

Integer Linear Programming Modeling DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem

More information

Grade 6 Social Studies

Grade 6 Social Studies Grade 6 Social Studies Social Studies Grade(s) 6th Course Overview This course focuses on the five Wisconsin Model Academic standards for Social Studies: Geography, History, Political Science and Citizenship,

More information

Scheduling with Constraint Programming. Job Shop Cumulative Job Shop

Scheduling with Constraint Programming. Job Shop Cumulative Job Shop Scheduling with Constraint Programming Job Shop Cumulative Job Shop CP vs MIP: Task Sequencing We need to sequence a set of tasks on a machine Each task i has a specific fixed processing time p i Each

More information

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

Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment Matthias Horn 1, Günther Raidl 1, and Christian Blum 2 1 Institute of Computer

More information

Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem

Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem Online Companion for Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem Germán Morales-España, Jesus M. Latorre, and Andres Ramos Universidad Pontificia Comillas, Spain Institute

More information

NP-Completeness. NP-Completeness 1

NP-Completeness. NP-Completeness 1 NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and

More information

Single processor scheduling with time restrictions

Single processor scheduling with time restrictions J Sched manuscript No. (will be inserted by the editor) Single processor scheduling with time restrictions O. Braun F. Chung R. Graham Received: date / Accepted: date Abstract We consider the following

More information

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

A Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows A Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows Philipp Hungerländer Christian Truden 5th January 2017 Abstract In this extended abstract we introduce the

More information

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

Program Name: PGDBA Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70 Program Name: PGDBA Subject: Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70 Duration: 60 mins Instructions (Start of Assessment): Marks: 70 Time: 60 Minutes

More information

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

LPT rule: Whenever a machine becomes free for assignment, assign that job whose. processing time is the largest among those jobs not yet assigned. LPT rule Whenever a machine becomes free for assignment, assign that job whose processing time is the largest among those jobs not yet assigned. Example m1 m2 m3 J3 Ji J1 J2 J3 J4 J5 J6 6 5 3 3 2 1 3 5

More information

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

An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse Yongjia Song, James Luedtke Virginia Commonwealth University, Richmond, VA, ysong3@vcu.edu University

More information

Integer and Constraint Programming for Batch Annealing Process Planning

Integer and Constraint Programming for Batch Annealing Process Planning Integer and Constraint Programming for Batch Annealing Process Planning Willem-Jan van Hoeve and Sridhar Tayur Tepper School of Business, Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA 15213,

More information

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

Computers and Intractability. The Bandersnatch problem. The Bandersnatch problem. The Bandersnatch problem. A Guide to the Theory of NP-Completeness Computers and Intractability A Guide to the Theory of NP-Completeness The Bible of complexity theory Background: Find a good method for determining whether or not any given set of specifications for a

More information

Computers and Intractability

Computers and Intractability Computers and Intractability A Guide to the Theory of NP-Completeness The Bible of complexity theory M. R. Garey and D. S. Johnson W. H. Freeman and Company, 1979 The Bandersnatch problem Background: Find

More information

A Rough-Cut Capacity Planning Model with Overlapping

A Rough-Cut Capacity Planning Model with Overlapping A Rough-Cut Capacity Planning Model with Overlapping Georges Baydoun Alain Haït Robert Pellerin Bernard Clément Guillaume Bouvignies December 2014 CIRRELT-2014-65 Georges Baydoun 1,2, Alain Haït 3, Robert

More information

Scheduling Lecture 1: Scheduling on One Machine

Scheduling Lecture 1: Scheduling on One Machine Scheduling Lecture 1: Scheduling on One Machine Loris Marchal 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer environment,

More information

Decision Diagrams for Discrete Optimization

Decision Diagrams for Discrete Optimization Decision Diagrams for Discrete Optimization Willem Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Acknowledgments: David Bergman, Andre Cire, Samid

More information

Basic Scheduling Problems with Raw Material Constraints

Basic Scheduling Problems with Raw Material Constraints Basic Scheduling Problems with Raw Material Constraints Alexander Grigoriev, 1 Martijn Holthuijsen, 2 Joris van de Klundert 2 1 Faculty of Economics and Business Administration, University of Maastricht,

More information

Integer Linear Programming (ILP)

Integer Linear Programming (ILP) Integer Linear Programming (ILP) Zdeněk Hanzálek, Přemysl Šůcha hanzalek@fel.cvut.cz CTU in Prague March 8, 2017 Z. Hanzálek (CTU) Integer Linear Programming (ILP) March 8, 2017 1 / 43 Table of contents

More information

On-line scheduling of periodic tasks in RT OS

On-line scheduling of periodic tasks in RT OS On-line scheduling of periodic tasks in RT OS Even if RT OS is used, it is needed to set up the task priority. The scheduling problem is solved on two levels: fixed priority assignment by RMS dynamic scheduling

More information

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

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013 Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S

More information

Embedded Systems Development

Embedded Systems Development Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs

More information

Multiprocessor Scheduling of Age Constraint Processes

Multiprocessor Scheduling of Age Constraint Processes Multiprocessor Scheduling of Age Constraint Processes Lars Lundberg Department of Computer Science, University of Karlskrona/Ronneby, Soft Center, S-372 25 Ronneby, Sweden, email: Lars.Lundberg@ide.hk-r.se

More information

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

A Heuristic Method for Job-Shop Scheduling with an Infinite Wait Buffer A Heuristic Method for ob-shop Scheduling with an Infinite Wait Buffer - From One-Machine to Multi-Machine Problems Z.. Zhao *. Kim M. Luo H. C. Lau S. S. Ge.B. Zhang Abstract Through empirical comparison

More information

Performance Metrics for Computer Systems. CASS 2018 Lavanya Ramapantulu

Performance Metrics for Computer Systems. CASS 2018 Lavanya Ramapantulu Performance Metrics for Computer Systems CASS 2018 Lavanya Ramapantulu Eight Great Ideas in Computer Architecture Design for Moore s Law Use abstraction to simplify design Make the common case fast Performance

More information

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

Using Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling Using Integer Programming for Strategic Underground and Open Pit-to-Underground Scheduling Barry King Advisor: Alexandra Newman Operations Research with Engineering PhD Program August 5-6, 2016 Cutoff

More information

CS 6901 (Applied Algorithms) Lecture 3

CS 6901 (Applied Algorithms) Lecture 3 CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar

More information

Approximate policy iteration for dynamic resource-constrained project scheduling

Approximate policy iteration for dynamic resource-constrained project scheduling Approximate policy iteration for dynamic resource-constrained project scheduling Mahshid Salemi Parizi, Yasin Gocgun, and Archis Ghate June 14, 2017 Abstract We study non-preemptive scheduling problems

More information

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

Using column generation to solve parallel machine scheduling problems with minmax objective functions Using column generation to solve parallel machine scheduling problems with minmax objective functions J.M. van den Akker J.A. Hoogeveen Department of Information and Computing Sciences Utrecht University

More information

Scheduling Parallel Jobs with Linear Speedup

Scheduling Parallel Jobs with Linear Speedup Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl

More information

Classification of Dantzig-Wolfe Reformulations for MIP s

Classification of Dantzig-Wolfe Reformulations for MIP s Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation

More information

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

NP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35. NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and

More information

Decomposition Method for Project Scheduling with Spatial Resources

Decomposition Method for Project Scheduling with Spatial Resources Decomposition Method for Project Scheduling with Spatial Resources J.L. Hurink, A.L. Kok and J.J. Paulus University of Twente, PO box 217, 7500AE Enschede, The Netherlands, j.j.paulus@ewi.utwente.nl Project

More information

CHAPTER 16: SCHEDULING

CHAPTER 16: SCHEDULING CHAPTER 16: SCHEDULING Solutions: 1. Job A B C A B C 1 5 8 6 row 1 0 3 1 Worker 2 6 7 9 reduction 2 0 1 3 3 4 5 3 3 1 2 0 column reduction A B C 1 0 2 1 Optimum: 2 0 0 3 Worker 1, Job A 3 1 1 0 2 B 3 C

More information

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

A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/221353491 A Column Generation Based Destructive Lower Bound for Resource Constrained Project

More information

RCPSP Single Machine Problems

RCPSP Single Machine Problems DM204 Spring 2011 Scheduling, Timetabling and Routing Lecture 3 Single Machine Problems Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Resource

More information

A Re-optimization Approach for Train Dispatching

A Re-optimization Approach for Train Dispatching Zuse Institute Berlin Takustr. 7 14195 Berlin Germany FRANK FISCHER 1 BORIS GRIMM 2 TORSTEN KLUG 2 THOMAS SCHLECHTE 2 A Re-optimization Approach for Train Dispatching 1 University of Kassel, Algorithmic

More information

Chapter 3: Discrete Optimization Integer Programming

Chapter 3: Discrete Optimization Integer Programming Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo

More information

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

Computer Method for. Assembly Lines. Lindsay McClintock OPERMGT May 6, 2003 COMSOAL Computer Method for Sequencing Operations for Assembly Lines Lindsay McClintock OPERMGT 345 004 May 6, 2003 Today s Topics Assembly Line Balancing By Hand Overview Example Exercise By Computer

More information

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

A mathematical model for assembly line balancing model to consider disordering sequence of workstations A mathematical model for assembly line balancing model to consider disordering sequence of workstations William Ho,* and Ali Emrouznejad Operations and Information Management Group Aston Business School,

More information

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

What is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t. Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A

More information

An improved method for solving micro-ferry scheduling problems

An improved method for solving micro-ferry scheduling problems Delft University of Technology Delft Center for Systems and Control Technical report 12-028 An improved method for solving micro-ferry scheduling problems M. Burger, B. De Schutter, and H. Hellendoorn

More information

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

Metode şi Algoritmi de Planificare (MAP) Curs 2 Introducere în problematica planificării Metode şi Algoritmi de Planificare (MAP) 2009-2010 Curs 2 Introducere în problematica planificării 20.10.2009 Metode si Algoritmi de Planificare Curs 2 1 Introduction to scheduling Scheduling problem definition

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed

More information

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

Analysis of test-diagnose-fix strategies for complex manufacturing systems Systems Engineering Group Department of Mechanical Engineering Eindhoven University of Technology PO Box 513 5600 MB Eindhoven The Netherlands http://se.wtb.tue.nl/ SE Report: Nr. 2007-10 Analysis of test-diagnose-fix

More information

Revenue Maximization in a Cloud Federation

Revenue Maximization in a Cloud Federation Revenue Maximization in a Cloud Federation Makhlouf Hadji and Djamal Zeghlache September 14th, 2015 IRT SystemX/ Telecom SudParis Makhlouf Hadji Outline of the presentation 01 Introduction 02 03 04 05

More information

On Clearing Coupled Day-Ahead Electricity Markets

On Clearing Coupled Day-Ahead Electricity Markets On Clearing Coupled Day-Ahead Electricity Markets Johannes C. Müller Johannes.Mueller@math.uni-erlangen.de joint work with Alexander Martin Sebastian Pokutta Oct 2010 Johannes C. Müller Clearing Coupled

More information

New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks

New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks Patrick Andersen February 27, 2014 This project explores a recently developed type of scheduling problem that combines the two Operations

More information

Multi-Area Stochastic Unit Commitment for High Wind Penetration

Multi-Area Stochastic Unit Commitment for High Wind Penetration Multi-Area Stochastic Unit Commitment for High Wind Penetration Workshop on Optimization in an Uncertain Environment Anthony Papavasiliou, UC Berkeley Shmuel S. Oren, UC Berkeley March 25th, 2011 Outline

More information

Dynamic Scheduling with Genetic Programming

Dynamic Scheduling with Genetic Programming Dynamic Scheduling with Genetic Programming Domago Jakobović, Leo Budin domago.akobovic@fer.hr Faculty of electrical engineering and computing University of Zagreb Introduction most scheduling problems

More information

Lecture 8: Column Generation

Lecture 8: Column Generation Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective Vehicle routing problem 1 / 33 Cutting stock

More information

Decision Diagrams for Sequencing and Scheduling

Decision Diagrams for Sequencing and Scheduling Decision Diagrams for Sequencing and Scheduling Willem-Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Plan What can MDDs do for Combinatorial Optimization?

More information

Chapter 3: Discrete Optimization Integer Programming

Chapter 3: Discrete Optimization Integer Programming Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17

More information

Manufacturing System Flow Analysis

Manufacturing System Flow Analysis Manufacturing System Flow Analysis Ronald G. Askin Systems & Industrial Engineering The University of Arizona Tucson, AZ 85721 ron@sie.arizona.edu October 12, 2005 How Many IEs Does It Take to Change a

More information

Appendix A Solving Systems of Nonlinear Equations

Appendix A Solving Systems of Nonlinear Equations Appendix A Solving Systems of Nonlinear Equations Chapter 4 of this book describes and analyzes the power flow problem. In its ac version, this problem is a system of nonlinear equations. This appendix

More information

19. Logic constraints, integer variables

19. Logic constraints, integer variables CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 19. Logic constraints, integer variables If-then constraints Generalized assignment problems Logic constraints Modeling a restricted set of values

More information

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

Ordonnancement robuste de réseaux de capteurs sans fil pour le suivi d une cible mobile sous incertitudes Ordonnancement robuste de réseaux de capteurs sans fil pour le suivi d une cible mobile sous incertitudes Charly Lersteau Marc Sevaux André Rossi ROADEF 2016, Compiègne February 11, 2016 1/17 Context 2/17

More information

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

Math 164-1: Optimization Instructor: Alpár R. Mészáros Math 164-1: Optimization Instructor: Alpár R. Mészáros Final Exam, June 9, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 180 minutes. By writing your

More information

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

Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling Hanna Furmańczyk, Marek Kubale Abstract In the paper we consider the problems of equitable and semi-equitable

More information

Aperiodic Task Scheduling

Aperiodic Task Scheduling Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2017 年 11 月 29 日 These slides use Microsoft clip arts. Microsoft copyright

More information

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

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 Michael Kupfer San Jose State University Research Foundation NS mes, Moffett Field, C 8 th US Europe TM Seminar June 29 th July 2 nd Napa, C 0 SFO Motivation: Dependent Simultaneous runways Offset Instrument

More information

Marjan van den Akker. Han Hoogeveen Jules van Kempen

Marjan van den Akker. Han Hoogeveen Jules van Kempen Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines, and/or generalized precedence constraints Marjan van den Akker Han Hoogeveen Jules van Kempen

More information

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

Coin Changing: Give change using the least number of coins. Greedy Method (Chapter 10.1) Attempt to construct an optimal solution in stages. IV-0 Definitions Optimization Problem: Given an Optimization Function and a set of constraints, find an optimal solution. Optimal Solution: A feasible solution for which the optimization function has the

More information

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

Single Machine Scheduling: Comparison of MIP Formulations and Heuristics for. Interfering Job Sets. Ketan Khowala Single Machine Scheduling: Comparison of MIP Formulations and Heuristics for Interfering Job Sets by Ketan Khowala A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor

More information

The resource transfer problem

The resource transfer problem The resource transfer problem Illa Weiss and Christoph Schwindt Clausthal University of Technology, Germany {illa.weiss,christoph.schwindt}@tu-clausthal.de Keywords: vehicle routing and scheduling, project

More information

On Preemptive Scheduling on Uniform Machines to Minimize Mean Flow Time

On Preemptive Scheduling on Uniform Machines to Minimize Mean Flow Time On Preemptive Scheduling on Uniform Machines to Minimize Mean Flow Time Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus kravch@newman.bas-net.by

More information

Traffic Flow Impact (TFI)

Traffic Flow Impact (TFI) Traffic Flow Impact (TFI) Michael P. Matthews 27 October 2015 Sponsor: Yong Li, FAA ATO AJV-73 Technical Analysis & Operational Requirements Distribution Statement A. Approved for public release; distribution

More information