Improved Heuristics for Manufacturing Scheduling

Size: px
Start display at page:

Download "Improved Heuristics for Manufacturing Scheduling"

Transcription

1 Improved Heuristics for Manufacturing Scheduling A Thesis Submitted In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Engineering By SAPKAL SAGAR ULHAS Under the Supervision of Dr. DIPAK LAHA Mechanical Engineering Department Jadavpur University Kolkata , India September 2012

2 Improved Heuristics for Manufacturing Scheduling A Synopsis Submitted In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Engineering By SAPKAL SAGAR ULHAS Under the Supervision of Dr. DIPAK LAHA Mechanical Engineering Department Jadavpur University Kolkata , India September 2012

3 Improved Heuristics for Manufacturing Scheduling SYNOPSIS In the manufacturing context, scheduling is concerned with setting the order in which a given number of jobs must be processed on a specified set of machines so that one or more decision objectives are optimized. Flow shop scheduling problem is a class of widely studied scheduling problem with a strong engineering background, which represents nearly a quarter of manufacturing systems, assembly lines and information service facilities nowadays. Recent developments in scheduling theory have focused on extending the flow shop models to include more practical constraints. An important kind of flow shop scheduling problem is characterized by a no-wait constraint. A flow shop scheduling problem in which each job must be processed until completion without any interruption either on or between machines is called as no-wait flow shop scheduling problem. Some typical applications of this problem are encountered in metal processing, plastic moulding, steel factories, hot rolling industries, chemical and pharmaceutical processing, and also in advanced manufacturing, such as just-in-time production. A no-wait environment arises from the characteristics of the processing technology itself or from the absence of storage capacity between operations of a job. Within these environments, the goal is to find a schedule which tries to optimize a specified objective, such as total flow time. In manufacturing environments, total flow time minimization leads to stable or uniform utilization of resources, rapid turn-around of jobs, and minimizing in-process inventory. The no-wait flow shop scheduling problem comes under the class of NP-hard problem. For solving scheduling problems, known to be NP-complete, simple exact optimization methods such as integer programming or branch and bound have the limitations of solving with only small-sized problems. As the problem size increases, the computational time of the exact methods grows exponentially. So the use of heuristic solution procedure that has a modest computational requirement becomes the necessity though it does not guarantee optimality. 1

4 Due to the significance of no-wait flow shop scheduling problem in theory and in engineering applications, and due to the NP-hard nature of the problem, it is important to develop effective and efficient heuristics for solving this problem. These heuristics can be categorized as constructive heuristics and metaheuristics [1]. Constructive heuristics provide fast, frequently high quality solutions and are usually much easier to be implemented than metaheuristics. A good constructive heuristic developed for scheduling problem can be extendible to more complex environments. In the present work, we proposed constructive heuristics for the problem of general no-wait flow shop scheduling with minimization of total flow time. We developed heuristic 1 in two phases [2]. The first phase is based on the conjecture that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines [3]. The initial sequence is improved in the second phase through the use of job-pair called as block insertion followed by single job insertion of the block [4]. The heuristic 1 outperforms the existing two-phase heuristics [5, 6] for the problem under consideration. We proposed heuristic 2 which is developed in two phases [7]. The first phase is a penalty-shift method derived from the well-known Vogel s approximation method for generating the initial sequence [8]. The initial sequence is improved in the second phase by using the block insertion approach. The performance of heuristic 2 is superior to the existing two-phase heuristics [5, 6] and the modified existing heuristic [9]. We also developed heuristic 3 in three phases by modifying the heuristic 1. A local search technique known as forward pair-wise exchange is applied at the third phase and is looped with the second phase of the heuristic. The heuristic 3 outperforms the existing three-phase heuristics [9, 10] and is the best among all the state-of-the-art constructive heuristics for the problem under consideration. The exhaustive computational experimentations show that the proposed heuristics perform significantly better compared to the competing existing heuristics while not affecting the time complexity. Statistical tests are also used to substantiate the significance of the improved results by the proposed heuristics. On the basis of 2

5 computational results and statistical tests, it can be concluded that the proposed methods are relatively more effective in minimizing total flow time in no-wait flow shops. References 1. Sapkal, S.U., Laha, D., Behera, D.K., (2012) Optimization techniques for no-wait manufacturing scheduling: a review. Advanced Materials Research, Vols , Sapkal, S.U., Laha, D., (2011) An improved scheduling heuristic algorithm for nowait flow shops on total flow time criterion. Proceedings of 3 rd International Conference on Electronics Computer Technology, Vol. 3, , IEEE 3. Laha, D., Sapkal, S.U., (2011) An efficient heuristic algorithm for m-machine no-wait flow shops. Lecture notes in Engineering and Computer Science, Vol. 2188, Laha, D., Chakraborty, U.K., (2009) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology, Vol. 41, Rajendran, C., Chaudhuri, D., (1990) Heuristic algorithms for continuous flow-shop problem. Naval Research Logistic Quarterly, Vol. 37, Bertolissi, E., (2000) Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Material Processing Technology, Vol. 107, Sapkal, S.U., Laha, D., (2012) Application of VAM to manufacturing scheduling problems. Advanced Materials Research, Vols , Sapkal, S.U., Laha, D., (2011) Comparison of initial solutions of heuristics for nowait flow shop scheduling. Communications in Computer and Information Science, Vol. 250, , Springer-Verlag. 9. Aldowiasan, T., Allahverdi, A., (2004) New heuristics for m-machine no-wait flowshop to minimize total completion time. OMEGA International Journal of Management Science, Vol. 32, Framinan, J.M., Nagano, M.S., Moccellin, J.V., (2010) An efficient heuristic for total flowtime minimization in no-wait flowshops. International Journal of Advanced Manufacturing Technology, Vol. 46,

A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES

A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University

More information

ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 4, July 2013

ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 4, July 2013 Study of Kanban and Conwip Analysis on Inventory and Production Control System in an Industry Kailash Kumar Lahadotiya, Ravindra pathak, Asutosh K Pandey Rishiraj Institute of Technology, Indore-India,

More information

Introduction to production scheduling. Industrial Management Group School of Engineering University of Seville

Introduction to production scheduling. Industrial Management Group School of Engineering University of Seville Introduction to production scheduling Industrial Management Group School of Engineering University of Seville 1 Introduction to production scheduling Scheduling Production scheduling Gantt Chart Scheduling

More information

Scheduling Shop Scheduling. Tim Nieberg

Scheduling Shop Scheduling. Tim Nieberg Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations

More information

Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness

Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness Débora P. Ronconi Ernesto G. Birgin April 29, 2010 Abstract Scheduling problems involving

More information

Computer based Scheduling Tool for Multi-product Scheduling Problems

Computer based Scheduling Tool for Multi-product Scheduling Problems Computer based Scheduling Tool for Multi-product Scheduling Problems Computer based Scheduling Tool for Multi-product Scheduling Problems Adirake Chainual, Tawatchai Lutuksin and Pupong Pongcharoen Department

More information

High-Mix Low-Volume Flow Shop Manufacturing System Scheduling

High-Mix Low-Volume Flow Shop Manufacturing System Scheduling Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute

More information

SCHEDULING WITH MULTIPLE TASKS PER JOB THE CASE OF QUALITY CONTROL LABORATORIES IN THE PHARMACEUTICAL INDUSTRY

SCHEDULING WITH MULTIPLE TASKS PER JOB THE CASE OF QUALITY CONTROL LABORATORIES IN THE PHARMACEUTICAL INDUSTRY SCHEDULING WITH MULTIPLE TASKS PER JOB THE CASE OF QUALITY CONTROL LABORATORIES IN THE PHARMACEUTICAL INDUSTRY 1. INTRODUCTION During manufacturing, pharmaceutical products undergo multiple tests at the

More information

Approximability of Two-Machine No-Wait Flowshop Scheduling with Availability Constraints

Approximability of Two-Machine No-Wait Flowshop Scheduling with Availability Constraints Approximability of Two-Machine No-Wait Flowshop Scheduling with Availability Constraints T.C. Edwin Cheng 1, and Zhaohui Liu 1,2 1 Department of Management, The Hong Kong Polytechnic University Kowloon,

More information

Determining Inventory Levels in a CONWIP Controlled Job Shop

Determining Inventory Levels in a CONWIP Controlled Job Shop Determining Inventory Levels in a CONWIP Controlled Job Shop Sarah M. Ryan* Senior Member, IIE Department of Industrial and Management Systems Engineering University of Nebraska-Lincoln Lincoln, NE 68588-0518

More information

Factors to Describe Job Shop Scheduling Problem

Factors to Describe Job Shop Scheduling Problem Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus

More information

THROUGHPUT OPTIMIZATION IN ROBOTIC CELLS

THROUGHPUT OPTIMIZATION IN ROBOTIC CELLS Contents Preface xv 1. ROBOTIC CELLS IN PRACTICE 1 1.1 Cellular Manufacturing 2 1.2 Robotic Cell Flowshops 3 1.3 Throughput Optimization 7 1.4 Historical Overview 9 1.5 Applications 11 2. A CLASSIFICATION

More information

An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem

An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem Tatsunobu Kawai, Yasutaka Fujimoto Department of Electrical and Computer Engineering, Yokohama National University, Yokohama 240-8501

More information

CS/COE 1501 http://cs.pitt.edu/~bill/1501/

CS/COE 1501 http://cs.pitt.edu/~bill/1501/ CS/COE 1501 http://cs.pitt.edu/~bill/1501/ Lecture 01 Course Introduction Meta-notes These notes are intended for use by students in CS1501 at the University of Pittsburgh. They are provided free of charge

More information

MINIMUM FLOW TIME SCHEDULE GENETIC ALGORITHM FOR MASS CUSTOMIZATION MANUFACTURING USING MINICELLS

MINIMUM FLOW TIME SCHEDULE GENETIC ALGORITHM FOR MASS CUSTOMIZATION MANUFACTURING USING MINICELLS University of Kentucky UKnowledge University of Kentucky Master's Theses Graduate School 2006 MINIMUM FLOW TIME SCHEDULE GENETIC ALGORITHM FOR MASS CUSTOMIZATION MANUFACTURING USING MINICELLS Phanindra

More information

Curriculum Vitae. B.M.T. Lin, NCTU, TW

Curriculum Vitae. B.M.T. Lin, NCTU, TW Curriculum Vitae Bertrand Miao-Tsong Lin ( 林 妙 聰 ) Gender: Male Marital status: Married (1 son and 1 daughter) Date of Birth: May 4, 1964 Nationality: Taiwan, ROC Affiliation: Institute of Information

More information

A review of lot streaming in a flow shop environment with makespan criteria

A review of lot streaming in a flow shop environment with makespan criteria 6th International Conference on Industrial Engineering and Industrial Management. XVI Congreso de Ingeniería de Organización. Vigo, July 18-20, 2012 A review of lot streaming in a flow shop environment

More information

On lot streaming with multiple products

On lot streaming with multiple products DISKUSSIONSARBEITEN DER FAKULTÄT FÜR WIRTSCHAFTSWISSENSCHAFTEN DER UNIVERSITÄT BIELEFELD On lot streaming with multiple products Martin Feldmann Dirk Biskup Department of Business Administration and Economics

More information

Student Project Allocation Using Integer Programming

Student Project Allocation Using Integer Programming IEEE TRANSACTIONS ON EDUCATION, VOL. 46, NO. 3, AUGUST 2003 359 Student Project Allocation Using Integer Programming A. A. Anwar and A. S. Bahaj, Member, IEEE Abstract The allocation of projects to students

More information

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver

Optimal Scheduling for Dependent Details Processing Using MS Excel Solver BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of

More information

Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples

More information

Computer Integrated Manufacturing CIM A T I L I M U N I V E R S I T Y

Computer Integrated Manufacturing CIM A T I L I M U N I V E R S I T Y MFGE 404 Computer Integrated Manufacturing CIM A T I L I M U N I V E R S I T Y Manufacturing Engineering Department Lecture 1 - Introduction Dr. Saleh AMAITIK Fall 2005/2006 Production Systems Production

More information

How To Plan Production

How To Plan Production Journal of Engineering, Project, and Production Management 2014, 4(2), 114-123 Finite Capacity Scheduling of Make-Pack Production: Case Study of Adhesive Factory Theppakarn Chotpradit 1 and Pisal Yenradee

More information

A Linear Programming Based Method for Job Shop Scheduling

A Linear Programming Based Method for Job Shop Scheduling A Linear Programming Based Method for Job Shop Scheduling Kerem Bülbül Sabancı University, Manufacturing Systems and Industrial Engineering, Orhanlı-Tuzla, 34956 Istanbul, Turkey bulbul@sabanciuniv.edu

More information

Classification - Examples

Classification - Examples Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking

More information

Observations on PCB Assembly Optimization

Observations on PCB Assembly Optimization Observations on PCB Assembly Optimization A hierarchical classification scheme based on the number of machines (one or many) and number of boards (one or many) can ease PCB assembly optimization problems.

More information

2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering

2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering 2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization

More information

Chapter 5 Supporting Facility and Process Flows

Chapter 5 Supporting Facility and Process Flows Chapter 5 Supporting Facility and Process Flows Process View of a Hospital Process Performance Inventory Turns Process Flow Structures 1 Definition of a Business Process A process is a set of activities

More information

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

More information

Elevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital

Elevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital Elevator Simulation and Scheduling: Automated Guided Vehicles in a Hospital Johan M. M. van Rooij Guest Lecture Utrecht University, 31-03-2015 from x to u The speaker 2 Johan van Rooij - 2011 current:

More information

A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms

A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los

More information

MIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines

MIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 132 139 MIP-Based Approaches for Solving

More information

A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer

A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer Umar Waqas, Marc Geilen, Jack Kandelaars, Lou Somers,TwanBasten, Sander Stuijk, Patrick Vestjens, Henk Corporaal

More information

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem

A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical

More information

Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling

Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute

More information

Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times

Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times Hindawi Publishing Corporation Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent

More information

Parallel CLM starting solutions comparison *

Parallel CLM starting solutions comparison * 4 th International Conference on Industrial Engineering and Industrial Management XIV Congreso de Ingeniería de Organización Donostia- San Sebastián, September 8 th -10 th 2010 Parallel CLM starting solutions

More information

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir. Chapter Three

1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir. Chapter Three Chapter Three Scheduling, Sequencing and Dispatching 3-1- SCHEDULING Scheduling can be defined as prescribing of when and where each operation necessary to manufacture the product is to be performed. It

More information

EXAMINATION OF SCHEDULING METHODS FOR PRODUCTION SYSTEMS. 1. Relationship between logistic and production scheduling

EXAMINATION OF SCHEDULING METHODS FOR PRODUCTION SYSTEMS. 1. Relationship between logistic and production scheduling Advanced Logistic Systems, Vol. 8, No. 1 (2014), pp. 111 120. EXAMINATION OF SCHEDULING METHODS FOR PRODUCTION SYSTEMS ZOLTÁN VARGA 1 PÁL SIMON 2 Abstract: Nowadays manufacturing and service companies

More information

Complex Job Shop Scheduling: A General Model and Method

Complex Job Shop Scheduling: A General Model and Method Department of Informatics University of Fribourg, Switzerland Complex Job Shop Scheduling: A General Model and Method Thesis presented to the Faculty of Economics and Social Sciences at the University

More information

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

More information

Planning and Scheduling in the Digital Factory

Planning and Scheduling in the Digital Factory Institute for Computer Science and Control Hungarian Academy of Sciences Berlin, May 7, 2014 1 Why "digital"? 2 Some Planning and Scheduling problems 3 Planning for "one-of-a-kind" products 4 Scheduling

More information

Dynamic programming formulation

Dynamic programming formulation 1.24 Lecture 14 Dynamic programming: Job scheduling Dynamic programming formulation To formulate a problem as a dynamic program: Sort by a criterion that will allow infeasible combinations to be eli minated

More information

SIMS 255 Foundations of Software Design. Complexity and NP-completeness

SIMS 255 Foundations of Software Design. Complexity and NP-completeness SIMS 255 Foundations of Software Design Complexity and NP-completeness Matt Welsh November 29, 2001 mdw@cs.berkeley.edu 1 Outline Complexity of algorithms Space and time complexity ``Big O'' notation Complexity

More information

Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q...

Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q... Lecture 4 Scheduling 1 Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max structure of a schedule 0 Q 1100 11 00 11 000 111 0 0 1 1 00 11 00 11 00

More information

A Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem

A Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem American Journal of Industrial and Business Management, 2016, 6, 774-789 Published Online June 2016 in SciRes. http://www.scirp.org/journal/ajibm http://dx.doi.org/10.4236/ajibm.2016.66071 A Study of Crossover

More information

vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK

vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES

More information

Integrated Maintenance and Production Scheduling with. Stochastic Failures and Non-Resumable Jobs

Integrated Maintenance and Production Scheduling with. Stochastic Failures and Non-Resumable Jobs Essays on Integrated Maintenance and Production Scheduling with Stochastic Failures and Non-Resumable Jobs Inaugural-Dissertation zur Erlangung des akademischen Grades eines Doktors der Wirtschafts- und

More information

Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration

Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration 1 Harish H G, 2 Dr. R Girisha 1 PG Student, 2 Professor, Department of CSE, PESCE Mandya (An Autonomous Institution under

More information

Measuring the Performance of an Agent

Measuring the Performance of an Agent 25 Measuring the Performance of an Agent The rational agent that we are aiming at should be successful in the task it is performing To assess the success we need to have a performance measure What is rational

More information

Modeling Multi-Echelon Multi-Supplier Repairable Inventory Systems with Backorders

Modeling Multi-Echelon Multi-Supplier Repairable Inventory Systems with Backorders J. Service Science & Management, 2010, 3, 440-448 doi:10.4236/jssm.2010.34050 Published Online December 2010 (http://www.scirp.org/journal/jssm) Modeling Multi-Echelon Multi-Supplier Repairable Inventory

More information

Multiobjective Multicast Routing Algorithm

Multiobjective Multicast Routing Algorithm Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9 - National University of Asunción Asunción Paraguay. Tel/Fax: (+9-) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms Computational Complexity Escola Politècnica Superior d Alcoi Universitat Politècnica de València Contents Introduction Resources consumptions: spatial and temporal cost Costs

More information

The Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain

The Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop

More information

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is

More information

Clustering and scheduling maintenance tasks over time

Clustering and scheduling maintenance tasks over time Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating

More information

CONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XVI - Fault Accomodation Using Model Predictive Methods - Jovan D. Bošković and Raman K.

CONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XVI - Fault Accomodation Using Model Predictive Methods - Jovan D. Bošković and Raman K. FAULT ACCOMMODATION USING MODEL PREDICTIVE METHODS Scientific Systems Company, Inc., Woburn, Massachusetts, USA. Keywords: Fault accommodation, Model Predictive Control (MPC), Failure Detection, Identification

More information

Reliable Systolic Computing through Redundancy

Reliable Systolic Computing through Redundancy Reliable Systolic Computing through Redundancy Kunio Okuda 1, Siang Wun Song 1, and Marcos Tatsuo Yamamoto 1 Universidade de São Paulo, Brazil, {kunio,song,mty}@ime.usp.br, http://www.ime.usp.br/ song/

More information

Scheduling Programming Activities and Johnson's Algorithm

Scheduling Programming Activities and Johnson's Algorithm Scheduling Programming Activities and Johnson's Algorithm Allan Glaser and Meenal Sinha Octagon Research Solutions, Inc. Abstract Scheduling is important. Much of our daily work requires us to juggle multiple

More information

An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups

An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 19 An ant colony optimization for single-machine weighted tardiness

More information

Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li

Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order

More information

CAD Algorithms. P and NP

CAD Algorithms. P and NP CAD Algorithms The Classes P and NP Mohammad Tehranipoor ECE Department 6 September 2010 1 P and NP P and NP are two families of problems. P is a class which contains all of the problems we solve using

More information

SINGLE-STAGE MULTI-PRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION

SINGLE-STAGE MULTI-PRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION SIGLE-STAGE MULTI-PRODUCT PRODUCTIO AD IVETORY SYSTEMS: A ITERATIVE ALGORITHM BASED O DYAMIC SCHEDULIG AD FIXED PITCH PRODUCTIO Euclydes da Cunha eto ational Institute of Technology Rio de Janeiro, RJ

More information

GA as a Data Optimization Tool for Predictive Analytics

GA as a Data Optimization Tool for Predictive Analytics GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, chandra.j@christunivesity.in

More information

A New Approach for Finite Capacity Planning in MRP Environment

A New Approach for Finite Capacity Planning in MRP Environment A New Approach for Finite Capacity Planning in MRP Environment Hong-bum Na 1, Hyoung-Gon Lee 1, and Jinwoo Park 1 1 Dept. of Industrial Engeering / Automation & Systems Research Inst. Seoul National University

More information

Resource grouping selection to minimize the maximum over capacity planning

Resource grouping selection to minimize the maximum over capacity planning 2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Resource grouping selection to minimize the maximum over capacity

More information

CHAPTER 6 MAJOR RESULTS AND CONCLUSIONS

CHAPTER 6 MAJOR RESULTS AND CONCLUSIONS 133 CHAPTER 6 MAJOR RESULTS AND CONCLUSIONS The proposed scheduling algorithms along with the heuristic intensive weightage factors, parameters and ß and their impact on the performance of the algorithms

More information

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm. Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

More information

A Bicriteria Simulated Annealing Algorithm for Scheduling Jobs on Parallel Machines with Sequence Dependent Setup Times

A Bicriteria Simulated Annealing Algorithm for Scheduling Jobs on Parallel Machines with Sequence Dependent Setup Times ISSN 0280-5316 ISRN LUTFD2/TFRT--5821--SE A Bicriteria Simulated Annealing Algorithm for Scheduling Jobs on Parallel Machines with Sequence Dependent Setup Times Rasmus Persson Department of Automatic

More information

Production Management for the Pulp and Paper Industry. Industrial IT Tools for Production Data Management

Production Management for the Pulp and Paper Industry. Industrial IT Tools for Production Data Management Production Management for the Pulp and Paper Industry Industrial IT Tools for Production Data Management Towards Optimum Mill Performance with Managing the production process Industrial IT Production Management

More information

Feature Selection vs. Extraction

Feature Selection vs. Extraction Feature Selection In many applications, we often encounter a very large number of potential features that can be used Which subset of features should be used for the best classification? Need for a small

More information

Guidelines for Industrial Internships as per November 18 th 2008

Guidelines for Industrial Internships as per November 18 th 2008 Guidelines for Industrial Internships as per November 18 th 2008 Special section of the study and examination regulations (SPO) of the Esslingen University of Applied Sciences to regulate the voluntary

More information

PRODUCTION PLANNING AND SCHEDULING Part 1

PRODUCTION PLANNING AND SCHEDULING Part 1 PRODUCTION PLANNING AND SCHEDULING Part Andrew Kusiak 9 Seamans Center Iowa City, Iowa - 7 Tel: 9-9 Fax: 9-669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Forecasting Planning Hierarchy

More information

Assembly line balancing to minimize balancing loss and system loss. D. Roy 1 ; D. Khan 2

Assembly line balancing to minimize balancing loss and system loss. D. Roy 1 ; D. Khan 2 J. Ind. Eng. Int., 6 (11), 1-, Spring 2010 ISSN: 173-702 IAU, South Tehran Branch Assembly line balancing to minimize balancing loss and system loss D. Roy 1 ; D. han 2 1 Professor, Dep. of Business Administration,

More information

Real-time Scheduling Using Minimin Search

Real-time Scheduling Using Minimin Search From: AAAI Technical Report SS-92-01. Compilation copyright 1992, AAAI (www.aaai.org). All rights reserved. Real-time Scheduling Using Minimin Search Prasad Tadepalli and Varad Joshi Department of Computer

More information

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

More information

DEMANDS ON MANUFACTURING METROLOGY AND SOLUTIONS

DEMANDS ON MANUFACTURING METROLOGY AND SOLUTIONS DEMANDS ON MANUFACTURING METROLOGY AND SOLUTIONS T. Pfeifer and D. Effenkammer Laboratory for Machine Tools and Production Engineering (WZL) Chair of Metrology and Quality Management, University Aachen,

More information

Chapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling

Chapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

More information

PART AND TOOL FLOW MANAGEMENT IN MULTI-CELL FLEXIBLE MANUFACTURING SYSTEM

PART AND TOOL FLOW MANAGEMENT IN MULTI-CELL FLEXIBLE MANUFACTURING SYSTEM PART AND TOOL FLOW MANAGEMENT IN MULTI-CELL FLEXIBLE MANUFACTURING SYSTEM Mustafa Özbayrak Department of Industrial Engineering Marmara University 81040 Goztepe - Istanbul, TURKEY A. Kursad Turker Melek

More information

Service courses for graduate students in degree programs other than the MS or PhD programs in Biostatistics.

Service courses for graduate students in degree programs other than the MS or PhD programs in Biostatistics. Course Catalog In order to be assured that all prerequisites are met, students must acquire a permission number from the education coordinator prior to enrolling in any Biostatistics course. Courses are

More information

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines

Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr

More information

Xin Wang. Operational. Transportation Flanning. of Modern Freight. Forwarding Companies. Vehicle Routing under. Consideration of Subcontracting

Xin Wang. Operational. Transportation Flanning. of Modern Freight. Forwarding Companies. Vehicle Routing under. Consideration of Subcontracting Xin Wang Operational Transportation Flanning of Modern Freight Forwarding Companies Vehicle Routing under Consideration of Subcontracting and Request Exchange Foreword by Prof. Dr.-Ing. Herbert Kopfer

More information

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria www.ads.tuwien.ac.at

More information

Opus: University of Bath Online Publication Store http://opus.bath.ac.uk/

Opus: University of Bath Online Publication Store http://opus.bath.ac.uk/ England, M. (2014) Formulating problems for real algebraic geometry. In: UNSPECIFIED. Link to official URL (if available): Opus: University of Bath Online Publication Store http://opus.bath.ac.uk/ This

More information

Chapter 1 Global Optimization in Supply Chain Operations

Chapter 1 Global Optimization in Supply Chain Operations Chapter 1 Global Optimization in Supply Chain Operations Maksud Ibrahimov, Arvind Mohais, Zbigniew Michalewicz Abstract This chapter discusses some optimization issues from a business perspective in the

More information

A Comparison of Process Improvement between Lean and Lean-TQM Approach

A Comparison of Process Improvement between Lean and Lean-TQM Approach A Comparison of Process Improvement between Lean and Lean-TQM Approach Wathanyu Tatsana-iam and Jeerapat Ngaoprasertwong Lean approach has been applied for organizational improvement over the years. But

More information

cs171 HW 1 - Solutions

cs171 HW 1 - Solutions 1. (Exercise 2.3 from RN) For each of the following assertions, say whether it is true or false and support your answer with examples or counterexamples where appropriate. (a) An agent that senses only

More information

A Diagnostic Approach to Scheduling

A Diagnostic Approach to Scheduling Harish C Bahl * Neelam Bahl California State University, Chico, CA, U.S.A. Several algorithms and methodologies have been proposed for a variety of environments. In this paper, we suggest a diagnostic

More information

AN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS

AN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS versão impressa ISSN 0101-7438 / versão online ISSN 1678-5142 AN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS Jorge M. S. Valente Faculdade de Economia Universidade

More information

Production Planning Process in a Flexible Manufacturing Cell

Production Planning Process in a Flexible Manufacturing Cell ISBN 978-1-84626-xxx-x Proceedings of 2011 International Conference on Optimization of the Robots and Manipulators (OPTIROB 2011) Sinaia, Romania, 26-28 Mai, 2011, pp. xxx-xxx Production Planning Process

More information

Quantum and Non-deterministic computers facing NP-completeness

Quantum and Non-deterministic computers facing NP-completeness Quantum and Non-deterministic computers facing NP-completeness Thibaut University of Vienna Dept. of Business Administration Austria Vienna January 29th, 2013 Some pictures come from Wikipedia Introduction

More information

Problems, Methods and Tools of Advanced Constrained Scheduling

Problems, Methods and Tools of Advanced Constrained Scheduling Problems, Methods and Tools of Advanced Constrained Scheduling Victoria Shavyrina, Spider Project Team Shane Archibald, Archibald Associates Vladimir Liberzon, Spider Project Team 1. Introduction In this

More information

HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE

HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE 1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction

More information

A Comparison of General Approaches to Multiprocessor Scheduling

A Comparison of General Approaches to Multiprocessor Scheduling A Comparison of General Approaches to Multiprocessor Scheduling Jing-Chiou Liou AT&T Laboratories Middletown, NJ 0778, USA jing@jolt.mt.att.com Michael A. Palis Department of Computer Science Rutgers University

More information

Introduction. Abstract

Introduction. Abstract Staff Scheduling with ILOG Solver Donovan R. Hare Department of Mathematics & Statistics Okanagan University College 3333 College Way Kelowna, BC Canada V1V 1V7 Error! Bookmark not defined. Abstract This

More information

Planning and Scheduling in Manufacturing and Services

Planning and Scheduling in Manufacturing and Services Michael L. Pinedo Planning and Scheduling in Manufacturing and Services Second edition 4y Springer Preface Contents of CD-ROM vii xvii Part I Preliminaries 1 Introduction 3 1.1 Planning and Scheduling:

More information

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004 Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February

More information

AXIS ENTERPRISE RESOURSE PLANNING

AXIS ENTERPRISE RESOURSE PLANNING AXIS ENTERPRISE RESOURSE PLANNING ERP FOR METALS, WIRE AND CABLE Streamline operations, increase productivity and reduce costs: Axis helps you compete in today s global markets with superior tools and

More information

INLINE INFRARED THERMOGRAPHY APPLIED FOR QUALITY GATES AND FOR MOULD TEMPERATURE CONTROL IN THE INJECTION MOULDING PROCESS.

INLINE INFRARED THERMOGRAPHY APPLIED FOR QUALITY GATES AND FOR MOULD TEMPERATURE CONTROL IN THE INJECTION MOULDING PROCESS. URN (Paper): urn:nbn:de:gbv:ilm1-2014iwk-182:2 58 th ILMENAU SCIENTIFIC COLLOQUIUM Technische Universität Ilmenau, 08 12 September 2014 URN: urn:nbn:de:gbv:ilm1-2014iwk:3 INLINE INFRARED THERMOGRAPHY APPLIED

More information