INTELLIGENT PRODUCTION SCHEDULING A CASE STUDY

Size: px
Start display at page:

Download "INTELLIGENT PRODUCTION SCHEDULING A CASE STUDY"

Transcription

1 International Journal of Mechanical Engineering and Technology (IJMET) Volume 8, Issue 6, June 2017, pp , Article ID: IJMET_08_06_029 Available online at ISSN Print: and ISSN Online: IAEME Publication Scopus Indexed INTELLIGENT PRODUCTION SCHEDULING A CASE STUDY N.K. Sethy Mechanical Engineering Department IGIT, Sarang, Odisha, India Dr. D.K. Behera Mechanical Engineering Department IGIT, Sarang, Odisha, India ABSTRACT Scheduling is a significant decision making process widely used in manufacturing production, management, computer science, etc. Operation research scheduling can reduce material handling costs and time by optimising the procedure. Finding good schedules for given sets of jobs so can help factory supervisors to control job flows effectively and provide solutions for job sequencing. Scheduling problems are usually modelled and solved in a mathematically feasible way. As a result the solutions generated from these greatly simplified problems are infeasible for real-life cases. The complexity and instability of production systems are still underestimated in many scheduling techniques in academic literature and the flexible production concept in mould shop has been rarely studied. It is necessary to develop an appropriate scheduling procedure algorithm to meet the industry s need. The study presents an approach to solve NP-Hard Flexible Flow Shop problems of more than two machine center to obtain optimum makespan. This approach uses First in First out (FIFO) dispatching rule and second approach integrates Random key method with Genetic Algorithm (RKGA) these approach has been implemented with MATLAB R2014a the approach has been tested on a Flexible Flow Shop Problem which was solved previously by the random keys representation can avoid the existence of duplicated positions value in sequencing. The result shows that Random Key Genetic Algorithm approach obtains the best minimum optimum makespan for different set of jobs with different processing time. Though the computation time is more comparatively to the FIFO approach. The RKGA can be applied in different scheduling problems in future study. Key words: Scheduling, Flexible Flow Shop, FIFO, RKGA, Makespan. Cite this Article: N.K. Sethy and Dr. D.K. Behera. Intelligent Production Scheduling - A Case Study. International Journal of Mechanical Engineering and Technology, 8(6), 2017, pp editor@iaeme.com

2 Intelligent Production Scheduling - A Case Study 1. INTRODUCTION Scheduling is a significant process widely used in manufacturing technology, production management, computer science, etc. In simple flow shop problems, each machine center has more than one machine if at least one machine [1, 3, 4-7] the problem is called Flexible Flow Shop problem. Flexible Flow Shops are thus the generalization of simple flow shops [2]. Scheduling jobs in Flexible Flow Shop is considered as NP-Hard problem. [8, 9]. The rest of the paper is organized as follows. Introduction and Problems in production Planning are explained in section I. Previous works done on this field are given in the section II. The techniques and problem that has been used is presented in section III. Implementation of the approach and experimental results are presented in section IV. Concluding remarks are given in section V Problems in Production Planning Inadequacy of present product planning approach The project schedule is discussed with customers before the launch of any project tooling department is responsible for giving an estimated mould making time for reference. However, production plan of each project is constructed on an ad hoc basis. The wide variation in production routes complicates the planning process. The total processing time can only be estimated roughly before the completion of detailed product design. When multiple projects are running simultaneously, it is highly possible that the projects schedulesconflict with one another s. Currently, there are two solutions to deal with the overload problems: first outsource some of the jobs; second, request for postpone of delivery date. The latter solution, which can lead to dissatisfaction of customers, is less preferable. Outsourcing is usually decided at the last minute which decreases the flexibility of the project schedule. [10] Frequent happenings of unpredictable incidents Unpredictable incidents often alter projects progress and induce rescheduling of the tasks. These incidents include delays in order releases of urgent orders, cancelations of orders and machine breakdowns. Delays in order releases happen when the precedent operations cannot finish on time or the required resources are not available. Urgent orders are usually the reworking operations. A work piece is reworked when it cannot pass the quality check or its specification is amended. These urgent orders add extra workloads to the shop. Cancellations of orders occur when project managers ask for a pause. Machine breakdowns can be caused by operation errors or malfunctions of machines. It takes a period of time to fix the problems so the shop capacity drops until the machines are repaired. Frequent happenings of unpredictable incidents bring chaos to the mould shop. [10] The objective of this project is to study a scheduling algorithm which can generate feasible schedules quickly to production planner for decision making. The problem studied in the paper is a Flexible Flow Shop Problem where we assume each machine center has the same number of parallel machine. This study precisely focusses on the minimization of the makespan of the FFSP. The algorithms have been evolved to workout Flexible Flow Shop scheduling problem with more than two machine centers. The first one extends FIFO Rule approach to get a nearly optimal makespan. FIFO approach is first used to assign jobs to each flow shop and a schedule is obtained after simulation of FIFO dispatching rule. The second one is an optimal algorithm entirely using Random Key Genetic Algorithm technique. Experimental results show that Random Key Genetic Algorithm generates minimum optimal makespan editor@iaeme.com

3 N.K. Sethy and Dr. D.K. Behera 2. LITERATURE REVIEW Over the last decade the competition among over last decade the competition among mould makers is highly fierce many mould makers has adopted different approach in order to remain competitive. They are aiming at making moulds with better quality, lower cost and shorter delivery time. An intelligent mould shop has been developed by Korean researchers Choi, B. K., KO, K., & Kim, B. H. [2005] to enhance production efficiency and lower dependency on human skills. This intelligent mould shop comprises of three main location: Technical Data Processing Station, Loading Schedule Station, and Real-time Monitoring Station. The research points out that while most of the required technologies are available, the collaboration from the end-users is critical. Human factors should be considered when developing a system to replace manual works. [11] Production scheduling is a decision-making process to handle the allocation of machines to operations over a specific period of time in order to achieve one or multiple objectives [Pinedo M. L., 2008]. Study of scheduling problems has been considerably increased since 1950s. The scheduling problems. A great variety of the problems in practice causes the difficulty to formulate a common model for scheduling problems. A workable algorithm for one problem may not be effective on another slightly different problem. Many algorithms have been developed to deal with the variants of the problems. [12] 2.1. Intelligent Production Planning & Scheduling for Mould Making A studied problem of the mould shop [Liu, Liao, Yang, Wang, & Zhao, 2010] is classified as job shop scheduling problem. Genetic algorithm (GA) is employed to find the schedule with minimum makespan. The problem consists of seven machines and nine different production routes with 24 operations. Operation dependent transportation times and machine setup times are considered. The chromosomes are encoded in integers. Each gene represents a job, so the number of occurrences of a number is equal to the number of operations it undergoes. The operations of GA include roulette wheel method for chromosome selection, position based crossover, and two point exchange mutation. The population size is 5000, crossover probability is 0.8; and mutation probability is 0.1. The computation time used is seconds. [13] Choy in the year 2011 proposed a hybrid scheduling decision support model (SDSM) to solve the mould making scheduling problem. The studied problem of the mould shop is classified as job shop scheduling problem with identical parallel machines. The model is comprised of two modules: scheduling module and optimization module. The scheduling module generates the schedules with GA with the objective to minimize the makespan. The optimization module finds the most economic option to handle tardiness problem. It is proved that this model is more effective than manual scheduling. [14] editor@iaeme.com

4 Intelligent Production Scheduling - A Case Study Figure 2.1 Architecture of hybrid scheduling decision support model Choy [2011pp ] [14] Tang LapYing in the year 2013 proposed the paper Intelligent Production Scheduling for Mould Making to tackle the Asah is mould shop scheduling problem with new heuristic and meta-heuristic algorithms they are Random Keys Harmony Search (RKHS), hybrid Nawaz- Enscore-Ham (NEH), and Random Keys Genetic Algorithm (RKGA). Where he had done comparison between both heuristic and meta-heuristic algorithms and thus suggested that RKGA method performs best and suggests that the method gives best makespan with the job size bellow 20 RKHS is suggested to be implemented for large jobs. [15] Gwoboa Horng, Tzung-Pei Hong, Pei-Ying Huang and Chan-Lon Wang in the year 2007 proposed three algorithms based on they are Sriskandarajah and Sethi s method by combining both the LPT and the Search-and-prune approaches to get a nearly optimal makespan. It is suitable for a medium sized number of jobs. The second one is optimal algorithm, using the Search-and-prune technique. It can work only when the job number is small. The third one is similar to the first one, except that it uses petrov s approach (PT) to deal with job sequencing instead of Search-and-prune. The experimental result shows that the computational time for the proposed algorithm is in the relation as follows: Algorithm 3 < Algorithm 1 < Algorithm 2, and the makespan has the following relation: Algorithm 3 >Algorithm 1 > Algorithm 2. A trade-off can thus be achieved between accuracy and time complexity. The choice among the three approaches to solve a Flexible Flow Shop Problem thus depends on the problem size, the allowed execution time and the allowed error. [16] 2.2. Theory of Constraints Fredendall & Lea in the year 1997 studied the application of TOC in master production scheduling. [17] Graham [in the year 2000 pointed out that the PERT/CPM approach can cause project overrun as people misuse the safety buffer time. They tend to start the activity as editor@iaeme.com

5 N.K. Sethy and Dr. D.K. Behera late as possible. TOC applies the buffer at the end of the whole project, so no feeding buffer in between activities. [18] Figure 2.2 Comparison between PERT/CPM and TOC with regard to safety time.graham [2000] 3. METHODOLOGIES The FFSSP is proved to be NP-hard, which has not been solved optimality in a reasonable time. The problem taken in this paper is the non-permutation FFSSP. Previously the problem has been solved by using three algorithms they are Sriskandarajah and Sethi s method by combining both the LPT and the Search-and-prune approaches to get a nearly optimal makespan. It is suitable for a medium sized number of jobs. The second one is optimal algorithm, using the Search-and-prune technique. It can work only when the job number is small. The third one is similar to the first one, except that it uses petrov s approach (PT) to deal with job sequencing instead of Search-and-prune. An integrated approach of heuristic and random keys representation is proposed to minimize the makespan which is the completion time of the last job. The problem has been solved by using FIFO rule then by the application of (RKGA) Random Key Genetic Algorithm and comparison has been done between two algorithms and result has been given. The studied problem has been formulated as bellow: Assume five jobs, J1 to J5, each having three tasks (t1j, t2j, t3j), are to be scheduled via three operations. Each operation is executed by a machine at the corresponding machine center. Each machine center includes two parallel machines. Assume the execution times of these jobs are listed. [16] Assumptions Jobs are not pre-emptive. Each job has m (m > 2) tasks with processing times, executed respectively on each of m machine centers. All machine centers have the same number of parallel machines editor@iaeme.com

6 Intelligent Production Scheduling - A Case Study Table 3.1 Processing Time for5 Jobs Jobj t1j t2j t3j J J J J J Table 3.2 Processing Time for 12 jobs Job j m1 m2 m3 j j j j j j j j j j j j Table 3.3 Processing Time for 20 jobs Job j m1 m2 m3 j j j j j j j j j j j j j j j j j j j j FIFO is the dispatching rule that does not follow either SPT (Shortest Processing Time) or EDD (Earliest Due Date). A schedule can be obtained after simulation of FIFO, below is the FIFO dispatching flow chart: editor@iaeme.com

7 N.K. Sethy and Dr. D.K. Behera Table 3.4 Input Parameters for FIFO N L Mi Vi k Ui,j Si L A0,k F0,j Ki,j Pi,j Ri,j Fi,j Ai,k MS Number of jobs Number of stages Number of machines at Stage i Speed of Machine k at Stage i Standard processing time of Job j at Stage i Setup time of a job at Stage i Entry point sequence of job set Available time of Machine k at Stage 0, i.e. current machine available time Finish time of Job j at Stage 0, i.e. job release time Table 3.5 Variables FIFO Selected machine of Job j at Stage i Processing time of Job j at Stage i Release time of Job j at Stage i Finish time of Job j at Stage i Available time of Machine k at Stage i Makespan of the schedule Figure 3.1 FIFO Algorithm Flow Chart editor@iaeme.com

8 Random Keys Genetic Algorithm. Intelligent Production Scheduling - A Case Study Figure 3.2 Flow Chart of Random Key Genetic Algorithm 4. IMPLIMENTATION The proposed algorithm is coded in MATLAB(2014) and executed on a laptop with 2.41GHz Intel i3 processor, 4GB RAM and windows 8 operating system. MATLAB is chosen over the other programming languages because it has matrix manipulation ability. Several mathematical operations that work on arrays or matrices are built-in to the MATLAB environment. The graphical output is optimized for interaction. Plotting is easy using the graphical interactive tools. MATLAB s functionality can be greatly expanded by the addition of toolboxes. Excel link allows data to be written in a format recognized by Excel. There are numeric resources about coding in MATLAB on internet. Problem instances are generated for testing the effectiveness of the proposed scheduling algorithms the static data such as machine speed, setup time, job initial release time, machine initial release time are kept constant. The experiment has conducted 10 iteration for 3 different sets of job for FIFO dispatching approach and the computation time is taken. Then RKGA approach is implemented with 100 iterations for 3 different sets of jobs and the optimum makespan is obtained the data has been taken from literature. Comparison between the makespan and computation times of both algorithms are done. The detailed about FIFO has been caried by[tang LapYing in the year 2013](15) editor@iaeme.com

9 5. EXPERIMENT AND RESULT N.K. Sethy and Dr. D.K. Behera 5.1. First In First Out (FIFO) The result analysis is shown in this part. For FIFO dispatching rule the algorithm has been computed which obtains a Machine available time, Makespan & computation time in seconds for 3 different sets of job and different processing time with 10 iteration given below: Table 5.1 Machine available time for 5 jobs JOB j M1 M2 M3 J J J J J Table 5.2 Machine available time for 12 jobs. JOB j M1 M2 M3 J J J J J J J J J J J J Table 5.3 Machine available time for 20 jobs. JOB j M1 M2 M3 J J J J J J J J J J J J J J J J J J J J editor@iaeme.com

10 Intelligent Production Scheduling - A Case Study As we know the highest value is taken as the makespan in case of FIFO approach.the above machine available time has been demonstrated in the form of Bar Chart: Figure 5.1 Machine available time for 5 jobs Figure 5.2 Machine available time for 12 jobs. Figure 5.3 Machine available time for 20 jobs editor@iaeme.com

11 N.K. Sethy and Dr. D.K. Behera Table 5.4 Computation time taken for 3 different sets of jobs by FIFO approach Number of jobs Makespan Iterations Computation time in (sec)avg Random Key Genetic Algorithm (RKGA) Here In the genetic algorithm the population size is taken as 3. As Genetic Algorithm is a heuristic approach we have taken Randomkey aproach as a result the method becomes metaheuristic. For the experiment we have taken 3 different job sets with different processing time and performed 100 iteration.bellow the result is discused: For 5 jobs: Figure 5.4 Makespan obtained for 5 jobs editor@iaeme.com

12 Intelligent Production Scheduling - A Case Study For 12 jobs: For 20 jobs: Figure 5.5 Makespan obtained for 12 jobs editor@iaeme.com

13 N.K. Sethy and Dr. D.K. Behera Figure 5.6 Makespan obtained for 20 jobs. Table 5.5 makespan number of iterations and computation time obtained by RKGA. Number of jobs Makespan Iterations Computation time in (sec) Table 5.6 Comparing the computation time of FIFO with RKGA approach. Number of jobs Computation time in (sec) for FIFO Computation time in (sec) for RKGA editor@iaeme.com

14 Intelligent Production Scheduling - A Case Study Figure 5.7 The average CPU times for processing 5,12,20 jobs by FIFO and RKGA approach. Makespan of FIFO And RKGA Makespan FIFO RKGA JOBj Figure 5.8 The average Makespan of processing 5,12,20 jobs by FIFO and RKGA approach. 6. CONCLUSIONS Applicable inteligent scheduling can not only reduce manufacturing costs but also reduces the material handling cost and time. Finding good schedules not only help company supervisors but also helps in controling the job flows and provide god job sequencing. Scheduling jobs in flexible flow shop has been known as NP-hard problem. In this study we have taken a NPhard problem which has been previously solved using sriskandrajah and sethi s method by combining both the LPT and the search- and prune approaches second one by search-and prune technique third one by petrovs approach. Thus in this study two approach has been presented based on First In First Out(FIFO)dispatching rule and the second one is integrated approach of Random Search and Genetic Algorithm. From the result as the time complexity in case of RKGA is higher at the cost of better makespan therefore it is economical from above work that RKGA is recommended for small jobs preferably below 20 jobs and 3 stages editor@iaeme.com

15 REFERENCES N.K. Sethy and Dr. D.K. Behera [1] Campbell, H. G., R. A. Dudek and M. L. Smith, A heuristic algorithm for the n job, m machine sequencing problem. Management Science. 16: B630-B637. [2] Chung, S. C. and D. Y. Liao, Scheduling flexible flow shops with no setup effects. The 1992 IEEE International Conference on Robotics and Automation. pp: [3] Dudek, R. A., S. S. Panwalkar and M. L. Smith, The lessons of flow shop scheduling research. Operations Research. 40: [4] Gupta, J. N. D., A functional heuristic algorithm for the flowshop scheduling problem. Operations Research. 40: [5] Nawaz, M., J. E. E. Enscore and I. Ham, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega. 11(1): [6] Palmer, D. S., Sequencing jobs through a Multi-stage process in the minimum total time- a Quick method of obtaining a near optimum. Operational Research Quarterly. 16(1): [7] Petrov s, V. A., Flow Line Group Production Planning. Business Publications, London. [8] Sriskandarajah, C. and S. P. Sethi, Scheduling algorithms for flexible flow shops: worst and average case performance. European Journal of Operational Research. 43: [9] Morton, T. E. and D. W. Pentico, Heuristic Scheduling Systems with Applications to Production Systems and Project Management. John Wiley & Sons Inc., New York. [10] Tang, L. Y., Yu, K. M., &Wan, Peter (2011). Flexible Mould Shop Scheduling using Harmony Search. Annual Journal of Institute of Industrial Engineers (Hong Kong), 31, [11] Choi, B. K., KO, K., & Kim, B. H. (2005). Development of Intelligent Mold Shop. Computer-Aided Design & Applications, 2 (5), pp [12] Pinedo, M. L. (2008). Scheduling: Theory, Algorithms, and Systems. New York: Springer. [13] Liu, Z., Liao, L., Yang, W., Wang, J., & Zhao, Y. (2010). Genetic Algorithm on Solving Mould Enterprise s Job-Shop Scheduling Problem. International Conference on Computing, Control and Industrial Engineering, pp [14] Choy, K. L., Leung, Y. K., Chow, H. K., Poon, T. C., Kwong, C. K., Ho, G. T., et al. (2011). A hybrid scheduling decision support model for minimizing job tardiness in a make-to-order based mould manufacturing environment. Expert Systems with Applications, 38, pp [15] TANG LAP YING The Hong Kong Polytechnic University Department of Industrial and Systems Engineering Intelligent Production Scheduling for Mould Making Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong [16] Tzung-Pei Hong, Pei-Ying Huang, Gwoboa Horng and Chan-Lon Wang Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan, R.O.C. Department of Computer Science and Information Engineering National Taiwan University, Taipei 106, Taiwan, R.O.C. Department of Computer Science National Chung-Hsing University, Taichung 402, Taiwan, R.O.C. American Journal of Applied Sciences 4 (11): ISSN [17] Fredendall, L. D., & Lea, B. R. (1997). Improving the product mix heuristic in the theory of constraints. International Journal of Production Research, 35 (6), editor@iaeme.com

16 Intelligent Production Scheduling - A Case Study [18] Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, R. Vidhyasri and R. Sivagamasundari, A Review on Factors Influencing Construction Project Scheduling. International Journal of Civil Engineering and Technology, 8(3), 2017, pp [19] Amani, M Al Hadidi and Rami Maher. Engineering Proj ect Management Planning and Scheduling. International Journal of Civil Engineering and Technology, 8(1), 2017, pp [20] Ch. Chowdeswari, D. Satish Chandra and SS.Asadi, Op timal Planning and Scheduling of High Rise Buildings. International Journal of Civil Engineering and Technology, 8(1), 2017, pp editor@iaeme.com

Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach

Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling

More information

ICMIEE-PI Minimization of Makespan in Flow Shop Scheduling Using Heuristics

ICMIEE-PI Minimization of Makespan in Flow Shop Scheduling Using Heuristics International Conference on Mechanical, Industrial and Energy Engineering 2014 25-26 December, 2014, Khulna, BANGLADESH ICMIEE-PI-14016310 000 Minimization of Makespan in Flow Shop Scheduling Using Heuristics

More information

INTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011

INTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011 Minimization of Total Weighted Tardiness and Makespan for SDST Flow Shop Scheduling using Genetic Algorithm Kumar A. 1 *, Dhingra A. K. 1 1Department of Mechanical Engineering, University Institute of

More information

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department

More information

Designing an Effective Scheduling Scheme Considering Multi-level BOM in Hybrid Job Shop

Designing an Effective Scheduling Scheme Considering Multi-level BOM in Hybrid Job Shop Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Designing an Effective Scheduling Scheme Considering Multi-level BOM

More information

Introduction to LEKIN

Introduction to LEKIN Introduction to LEKIN Gareth Beddoe 1 Introduction to LEKIN What is LEKIN? Machine Environments Methods Employed Graphical User Interface Setting up the Environment 2 Examples Single Machine Environment

More information

ISE480 Sequencing and Scheduling

ISE480 Sequencing and Scheduling ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for

More information

A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop

A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop Eric A. Siy Department of Industrial Engineering email : eric.siy@dlsu.edu.ph Abstract: The open shop is a job shop with no precedence

More information

Gyeongsang National University, Jinju, Korea b Department of MIS, Chungbuk National University, Chungbuk, Korea

Gyeongsang National University, Jinju, Korea b Department of MIS, Chungbuk National University, Chungbuk, Korea This article was downloaded by: [Gyeongsang National Uni], [Professor Kwan Hee Han] On: 25 November 2012, At: 20:32 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number:

More information

Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion

Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion Ajay Kumar Agarwal Assistant Professor, Mechanical Engineering Department RIMT, Chidana, Sonipat, Haryana,

More information

SELECTED HEURISTIC ALGORITHMS FOR SOLVING JOB SHOP AND FLOW SHOP SCHEDULING PROBLEMS

SELECTED HEURISTIC ALGORITHMS FOR SOLVING JOB SHOP AND FLOW SHOP SCHEDULING PROBLEMS SELECTED HEURISTIC ALGORITHMS FOR SOLVING JOB SHOP AND FLOW SHOP SCHEDULING PROBLEMS A THESIS SUBMITTED IN PARTIAL FULFILLMENT FOR THE REQUIREMENT OF THE DEGREE OF BACHELOR OF TECHNOLOGY IN MECHANICAL

More information

Solving the FMS Scheduling Problem by Critical Ratio-Based Heuristics and the Genetic Algorithm

Solving the FMS Scheduling Problem by Critical Ratio-Based Heuristics and the Genetic Algorithm Solving the FMS Scheduling Problem by Critical Ratio-Based Heuristics and the Genetic Algorithm Tsung-Che Chiang and Li-Chen Fu Dept. of Computer Science and Information Engineering, National Taiwan University,

More information

A neural reinforcement learning approach to learn local dispatching policies in production scheduling

A neural reinforcement learning approach to learn local dispatching policies in production scheduling A neural reinforcement learning approach to learn local dispatching policies in production scheduling Simone Riedmiller Institut fur Werkzeugmaschinen und Betriebstechnik (wbk) University of Karlsruhe

More information

MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH

MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH AHMAD SHAHRIZAL MUHAMAD, 1 SAFAAI DERIS, 2 ZALMIYAH ZAKARIA 1 Professor, Faculty of Computing, Universiti Teknologi

More information

A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing

A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing International Journal of Industrial Engineering, 15(1), 73-82, 2008. A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing Muh-Cherng Wu and Ting-Uao Hung Department of Industrial Engineering

More information

Procedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)

Procedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14) Available online at www.sciencedirect.com ScienceDirect Procedia - Social and ehavioral Sciences 189 ( 2015 ) 184 192 XVIII Annual International Conference of the Society of Operations Management (SOM-14)

More information

Routing Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA

Routing Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA Journal of Industrial Engineering and Management JIEM, 2014 7(5) : 1097-1111 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.1126 Routing Optimization of Fourth Party Logistics

More information

1. For s, a, initialize Q ( s,

1. For s, a, initialize Q ( s, Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS

More information

An Agent-Based Scheduling Framework for Flexible Manufacturing Systems

An Agent-Based Scheduling Framework for Flexible Manufacturing Systems An Agent-Based Scheduling Framework for Flexible Manufacturing Systems Iman Badr International Science Index, Industrial and Manufacturing Engineering waset.org/publication/2311 Abstract The concept of

More information

Research Article Genetic Algorithm for Job Scheduling with Maintenance Consideration in Semiconductor Manufacturing Process

Research Article Genetic Algorithm for Job Scheduling with Maintenance Consideration in Semiconductor Manufacturing Process Mathematical Problems in Engineering Volume 212, Article ID 875641, 16 pages doi:1.1155/212/875641 Research Article Genetic Algorithm for Job Scheduling with Maintenance Consideration in Semiconductor

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

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

JOB SEQUENCING & WIP LEVEL DETERMINATION IN A CYCLIC CONWIP FLOWSHOP WITH BLOCKING

JOB SEQUENCING & WIP LEVEL DETERMINATION IN A CYCLIC CONWIP FLOWSHOP WITH BLOCKING International Journal of Mechanical Engineering and Technology (IJMET) Volume 8, Issue 9, September 2017, pp. 274 280, Article ID: IJMET_08_09_029 Available online at http://www.iaeme.com/ijmet/issues.asp?jtype=ijmet&vtype=8&itype=9

More information

JOB SHOP SCHEDULING WITH EARLINESS, TARDINESS AND INTERMEDIATE INVENTORY HOLDING COSTS

JOB SHOP SCHEDULING WITH EARLINESS, TARDINESS AND INTERMEDIATE INVENTORY HOLDING COSTS JOB SHOP SCHEDULING WITH EARLINESS, TARDINESS AND INTERMEDIATE INVENTORY HOLDING COSTS Kerem Bulbul Manufacturing Systems and Industrial Engineering, Sabanci University, Istanbul, Turkey bulbul@sabanciuniv.edu

More information

Optimal Operator Assignment In An Assembly Line Using Genetic Algorithm

Optimal Operator Assignment In An Assembly Line Using Genetic Algorithm Optimal Operator Assignment in an Assembly Line using Genetic Algorithm 1 Optimal Operator Assignment In An Assembly Line Using Genetic Algorithm TANZINA ZAMAN, SANJOY KUMAR PAUL* AND ABDULLAHIL AZEEM

More information

Analyzing Controllable Factors Influencing Cycle Time Distribution in. Semiconductor Industries. Tanushree Salvi

Analyzing Controllable Factors Influencing Cycle Time Distribution in. Semiconductor Industries. Tanushree Salvi Analyzing Controllable Factors Influencing Cycle Time Distribution in Semiconductor Industries by Tanushree Salvi A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of

More information

SCHEDULING JOBS ON A SINGLE BPM WITH NON-AGREEABLE RELEASE TIME AND DUE DATES TO MINIMIZE MAKESPAN

SCHEDULING JOBS ON A SINGLE BPM WITH NON-AGREEABLE RELEASE TIME AND DUE DATES TO MINIMIZE MAKESPAN 1 Abstract Number: 025-1195 SCHEDULING JOBS ON A SINGLE BPM WITH NON-AGREEABLE RELEASE TIME AND DUE DATES TO MINIMIZE MAKESPAN Ganeshkumar Palanichamy WIPRO Technologies Electronic city Bangalore 560 100

More information

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds Proceedings of the 0 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds OPTIMAL BATCH PROCESS ADMISSION CONTROL IN TANDEM QUEUEING SYSTEMS WITH QUEUE

More information

Analysis of the job shop system with transport and setup times in deadlock-free operating conditions

Analysis of the job shop system with transport and setup times in deadlock-free operating conditions Archives of Control Sciences Volume 22(LVIII), 2012 No. 4, pages 417 425 Analysis of the job shop system with transport and setup times in deadlock-free operating conditions JOLANTA KRYSTEK and MAREK KOZIK

More information

SCHEDULING IN MANUFACTURING SYSTEMS

SCHEDULING IN MANUFACTURING SYSTEMS In process planning, the major issue is how to utilize the manufacturing system s resources to produce a part: how to operate the different manufacturing processes. In scheduling. The issue is when and

More information

Evolutionary Algorithms

Evolutionary Algorithms Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or

More information

Research and Applications of Shop Scheduling Based on Genetic Algorithms

Research and Applications of Shop Scheduling Based on Genetic Algorithms 1 Engineering, Technology and Techniques Vol.59: e16160545, January-December 2016 http://dx.doi.org/10.1590/1678-4324-2016160545 ISSN 1678-4324 Online Edition BRAZILIAN ARCHIVES OF BIOLOGY AND TECHNOLOGY

More information

Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and Petri Nets

Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and Petri Nets Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and

More information

Minimizing Mean Tardiness in a Buffer-Constrained Dynamic Flowshop - A Comparative Study

Minimizing Mean Tardiness in a Buffer-Constrained Dynamic Flowshop - A Comparative Study 015-0610 Minimizing Mean Tardiness in a Buffer-Constrained Dynamic Flowshop - A Comparative Study Ahmed El-Bouri Department of Operations Management and Business Statistics College of Commerce and Economics

More information

MINIMIZING MEAN COMPLETION TIME IN FLOWSHOPS WITH RANDOM PROCESSING TIMES

MINIMIZING MEAN COMPLETION TIME IN FLOWSHOPS WITH RANDOM PROCESSING TIMES 8 th International Conference of Modeling and Simulation - MOSIM 0 - May 0-, 00 - Hammamet - Tunisia Evaluation and optimization of innovative production systems of goods and services MINIMIZING MEAN COMPLETION

More information

Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization

Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization CECÍLIA REIS 1,2, LEONARDO PAIVA 2, JORGE MOUTINHO 2, VIRIATO M. MARQUES 1,3 1 GECAD Knowledge Engineering and Decision Support

More information

Energy management using genetic algorithms

Energy management using genetic algorithms Energy management using genetic algorithms F. Garzia, F. Fiamingo & G. M. Veca Department of Electrical Engineering, University of Rome "La Sapienza", Italy Abstract An energy management technique based

More information

Improved Crossover and Mutation Operators for Genetic- Algorithm Project Scheduling

Improved Crossover and Mutation Operators for Genetic- Algorithm Project Scheduling Improved Crossover and Mutation Operators for Genetic- Algorithm Project Scheduling M. A. Abido and A. Elazouni Abstract In Genetic Algorithms (GAs) technique, offspring chromosomes are created by merging

More information

AUTOSCHED TUTORIAL. Bill Lindler. AutoSimulations 655 E. Medical Drive Bountiful, Utah 84010, U.S.A.

AUTOSCHED TUTORIAL. Bill Lindler. AutoSimulations 655 E. Medical Drive Bountiful, Utah 84010, U.S.A. AUTOSCHED TUTORIAL Bill Lindler AutoSimulations 655 E. Medical Drive Bountiful, Utah 84010, U.S.A. ABSTRACT The AutoSched TM finite capacity planning and scheduling tool helps you increase throughput,

More information

A Genetic Algorithm on Inventory Routing Problem

A Genetic Algorithm on Inventory Routing Problem A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract

More information

Production Management Modelling Based on MAS

Production Management Modelling Based on MAS International Journal of Automation and Computing 7(3), August 2010, 336-341 DOI: 10.1007/s11633-010-0512-x Production Management Modelling Based on MAS Li He 1 Zheng-Hao Wang 2 Ke-Long Zhang 3 1 School

More information

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad. GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary

More information

A thesis presented to. the faculty of. In partial fulfillment. of the requirements for the degree. Master of Science. Kush Mathur.

A thesis presented to. the faculty of. In partial fulfillment. of the requirements for the degree. Master of Science. Kush Mathur. Mathematical Models and Genetic Algorithm Approaches to Simultaneously Perform Workforce Overtime Capacity Planning and Schedule Cells A thesis presented to the faculty of the Russ College of Engineering

More information

Keywords Genetic, pseudorandom numbers, cryptosystems, optimal solution.

Keywords Genetic, pseudorandom numbers, cryptosystems, optimal solution. Volume 6, Issue 8, August 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Apply Genetic

More information

Construction and Application of Mathematical Model Based on Intelligent Test Paper Generation Algorithm

Construction and Application of Mathematical Model Based on Intelligent Test Paper Generation Algorithm Construction and Application of Mathematical Model Based on Intelligent Test Paper Generation Algorithm Jin Zhang * School of Science, Shandong University of Technology, Zibo 25500, China *Corresponding

More information

Modeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach

Modeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach Modeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach B. Fahimnia, L.H.S. Luong, and R. M. Marian Abstract The Aggregate Production Plan (APP) is a schedule of the organization

More information

Randomized Algorithm with Tabu Search for Multi-Objective Optimization of Large Containership Stowage Plans

Randomized Algorithm with Tabu Search for Multi-Objective Optimization of Large Containership Stowage Plans Randomized Algorithm with Tabu Search for Multi-Objective Optimization of Large Containership Stowage Plans Fan Liu, Malcolm Yoke Hean Low, Wen Jing Hsu, Shell Ying Huang, Min Zeng, Cho Aye Win School

More information

EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY SCHEDULING

EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY SCHEDULING 24th International Symposium on on Automation & Robotics in in Construction (ISARC 2007) Construction Automation Group, I.I.T. Madras EFFECT OF CROSS OVER OPERATOR IN GENETIC ALGORITHMS ON ANTICIPATORY

More information

Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS)

Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS) I J PME International Journal of Production Management and Engineering doi:10.4995/ijpme.2016.4102 Received 2015-09-02 Accepted: 2016-04-29 Flow shop scheduling decisions through Techniques for Order Preference

More information

Applying Computational Intelligence in Software Testing

Applying Computational Intelligence in Software Testing www.stmjournals.com Applying Computational Intelligence in Software Testing Saumya Dixit*, Pradeep Tomar School of Information and Communication Technology, Gautam Buddha University, Greater Noida, India

More information

PROCESS ACCOMPANYING SIMULATION A GENERAL APPROACH FOR THE CONTINUOUS OPTIMIZATION OF MANUFACTURING SCHEDULES IN ELECTRONICS PRODUCTION

PROCESS ACCOMPANYING SIMULATION A GENERAL APPROACH FOR THE CONTINUOUS OPTIMIZATION OF MANUFACTURING SCHEDULES IN ELECTRONICS PRODUCTION Proceedings of the 2002 Winter Simulation Conference E. Yücesan, C.-H. Chen, J. L. Snowdon, and J. M. Charnes, eds. PROCESS ACCOMPANYING SIMULATION A GENERAL APPROACH FOR THE CONTINUOUS OPTIMIZATION OF

More information

SIMULATION OPTIMIZATION DECISION SUPPORT SYSTEM FOR SHIP PANEL SHOP OPERATIONS. 260 McCain Engineering Building; Box Mississippi Parkway

SIMULATION OPTIMIZATION DECISION SUPPORT SYSTEM FOR SHIP PANEL SHOP OPERATIONS. 260 McCain Engineering Building; Box Mississippi Parkway Proceedings of the 2005 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, eds. SIMULATION OPTIMIZATION DECISION SUPPORT SYSTEM FOR SHIP PANEL SHOP OPERATIONS Allen

More information

HCTL Open Int. J. of Technology Innovations and Research HCTL Open IJTIR, Volume 2, March 2013 e-issn: ISBN (Print):

HCTL Open Int. J. of Technology Innovations and Research HCTL Open IJTIR, Volume 2, March 2013 e-issn: ISBN (Print): Improved Shuffled Frog Leaping Algorithm for the Combined Heat and Power Economic Dispatch Majid karimzade@yahoo.com Abstract This paper presents an improved shuffled frog leaping algorithm (ISFLA) for

More information

A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator

A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1717-1733 Research India Publications http://www.ripublication.com A Study of Crossover Operators

More information

Transactions on the Built Environment vol 33, 1998 WIT Press, ISSN

Transactions on the Built Environment vol 33, 1998 WIT Press,  ISSN Effects of designated time on pickup/delivery truck routing and scheduling E. Taniguchf, T. Yamada\ M. Tamaishi*, M. Noritake^ "Department of Civil Engineering, Kyoto University, Yoshidahonmachi, Sakyo-kyu,

More information

The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories

The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories Journal of Physics: Conference Series PAPER OPEN ACCESS The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories To cite this article:

More information

PLANNING OF ORDER PICKING PROCESSES USING SIMULATION AND A GENETIC ALGORITHM IN MULTI-CRITERIA SCHEDULING OPTIMIZATION

PLANNING OF ORDER PICKING PROCESSES USING SIMULATION AND A GENETIC ALGORITHM IN MULTI-CRITERIA SCHEDULING OPTIMIZATION PLANNING OF ORDER PICKING PROCESSES USING SIMULATION AND A GENETIC ALGORITHM IN MULTI-CRITERIA SCHEDULING OPTIMIZATION Balázs Molnár Budapest University of Technology and Economics Department of Transportation

More information

Metaheuristics for Identical Parallel Machines Scheduling to Minimize Mean Tardiness

Metaheuristics for Identical Parallel Machines Scheduling to Minimize Mean Tardiness Metaheuristics for Identical Parallel Machines Scheduling to Minimize Mean Tardiness Husam Kaid 1,a, Ibrahim Alharkan 1,b, Atef Ghaleb 1,c, and Mageed A. Ghaleb 1,d 1 College of Engineering, Industrial

More information

OPTIMIZATION OF DISTRIBUTION ROUTE SELECTION BASED ON PARTICLE SWARM ALGORITHM

OPTIMIZATION OF DISTRIBUTION ROUTE SELECTION BASED ON PARTICLE SWARM ALGORITHM ISSN 1726-4529 Int j simul model 13 (2014) 2, 230-242 Original scientific paper OPTIMIZATION OF DISTRIBUTION ROUTE SELECTION BASED ON PARTICLE SWARM ALGORITHM Wu, Z. Information College, Capital University

More information

Genetic Based Task Scheduling Algorithms in Distributed Environments- Its Strengths, Weaknesses, Opportunity and Threats

Genetic Based Task Scheduling Algorithms in Distributed Environments- Its Strengths, Weaknesses, Opportunity and Threats Genetic Based Task Scheduling Algorithms in Distributed Environments- Its Strengths, Weaknesses, Opportunity and Threats Sunil Kumar Assistant Professor, Guru Nanak College for Girls, Sri Muktsar Sahib

More information

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,

More information

OPTIMIZATION OF PLANNING, SCHEDULING, AND CONTROL OF HIGH RISE CONSTRUCTION PROJECTS

OPTIMIZATION OF PLANNING, SCHEDULING, AND CONTROL OF HIGH RISE CONSTRUCTION PROJECTS International Journal of Civil Engineering and Technology (IJCIET) Volume 9, Issue 4, April 2018, pp. 914 922, Article ID: IJCIET_09_04_102 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=9&itype=4

More information

Backup Strategy for Failures in Robotic U-Shaped Assembly Line Systems

Backup Strategy for Failures in Robotic U-Shaped Assembly Line Systems University of Rhode Island DigitalCommons@URI Open Access Master's Theses 2016 Backup Strategy for Failures in Robotic U-Shaped Assembly Line Systems Alexander Gebel University of Rhode Island, alexander_gebel@my.uri.edu

More information

Dispatching for order-driven FABs with backward pegging

Dispatching for order-driven FABs with backward pegging PRODUCTION & MANUFACTURING RESEARCH ARTICLE Dispatching for order-driven FABs with backward pegging Yong H. Chung 1, S. Lee 1 and Sang C. Park 1 * Received: 17 May 2016 Accepted: 04 August 2016 First Published:

More information

QoS-based Scheduling for Task Management in Grid Computing

QoS-based Scheduling for Task Management in Grid Computing QoS-based Scheduling for Task Management in Grid Computing Xiaohong Huang 1, Maode Ma 2, Yan Ma 1 Abstract--Due to the heterogeneity, complexity, and autonomy of wide spread Grid resources, the dynamic

More information

Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study

Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study Robotics and Computer-Integrated Manufacturing ] (]]]]) ]]] ]]] www.elsevier.com/locate/rcim Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study V. Vinod

More information

The role of the production scheduling system in rescheduling

The role of the production scheduling system in rescheduling IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS The role of the production scheduling system in rescheduling To cite this article: K Kalinowski et al 2015 IOP Conf. Ser.: Mater.

More information

This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail.

This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail. Powered by TCPDF (www.tcpdf.org) This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail. Chattopadhyaya, Somnath; Mukhopadhyay,

More information

PRODUCTION PLANNING ANDCONTROL AND COMPUTER AIDED PRODUCTION PLANNING Production is a process whereby raw material is converted into semi-finished products and thereby adds to the value of utility of products,

More information

Optimization of Scheduling and Dispatching Cars on Demand

Optimization of Scheduling and Dispatching Cars on Demand San Jose State University SJSU ScholarWorks Master's Projects Master's Theses and Graduate Research Spring 5-25-2015 Optimization of Scheduling and Dispatching Cars on Demand Vu Tran SJSU Follow this and

More information

Iterative train scheduling in networks with tree topologies: a case study for the Hunter Valley Coal Chain

Iterative train scheduling in networks with tree topologies: a case study for the Hunter Valley Coal Chain 22nd International Congress on Modelling and Simulation, Hobart, Tasmania, Australia, 3 to 8 December 2017 mssanz.org.au/modsim2017 Iterative train scheduling in networks with tree topologies: a case study

More information

Genetic Algorithm: A Search of Complex Spaces

Genetic Algorithm: A Search of Complex Spaces Genetic Algorithm: A Search of Complex Spaces Namita Khurana, Anju Rathi, Akshatha.P.S Lecturer in Department of (CSE/IT) KIIT College of Engg., Maruti Kunj, Sohna Road, Gurgaon, India ABSTRACT Living

More information

Job Selection and Sequencing with Identical Tardiness Penalties

Job Selection and Sequencing with Identical Tardiness Penalties Job Selection and Sequencing with Identical Tardiness Penalties In the classical sequencing problem a set of available jobs exists, and the problem is to schedule those jobs in the presence of a limited

More information

Automated Clash Resolution of Steel Rebar in RC Beam Column Joints using BIM and GA

Automated Clash Resolution of Steel Rebar in RC Beam Column Joints using BIM and GA Automated Clash Resolution of Steel Rebar in RC Beam Column Joints using BIM and GA M. Mangal a, Q. Wang a and J.C.P. Cheng a a Department of Civil and Environmental Engineering, The Hong Kong University

More information

Real time disruption recovery for integrated berth allocation and crane assignment in container terminals

Real time disruption recovery for integrated berth allocation and crane assignment in container terminals Real time disruption recovery for integrated berth allocation and crane assignment in container terminals Mengze Li School of Naval Architecture, Ocean & Civil Engineering Shanghai Jiao Tong University

More information

Applying Robust Optimization to MISO Look- Ahead Commitment

Applying Robust Optimization to MISO Look- Ahead Commitment Applying Robust Optimization to MISO Look- Ahead Commitment Yonghong Chen, Qianfan Wang, Xing Wang, and Yongpei Guan Abstract Managing uncertainty has been a challenging task for market operations. This

More information

Soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems

Soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems International Journal of Automation and Computing 04(1), January 2007, 80-87 DOI: 10.1007/s11633-007-0080-x Soft Computing Based Procurement Planning of Time-variable Demand in Manufacturing Systems Kai

More information

A Viral Systems Algorithm for the Traveling Salesman Problem

A Viral Systems Algorithm for the Traveling Salesman Problem Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,

More information

Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm)

Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Intelligent Techniques Lesson 4 (Examples about Genetic Algorithm) Numerical Example A simple example will help us to understand how a GA works. Let us find the maximum value of the function (15x - x 2

More information

Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts

Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts DOI 10.1007/s00170-015-7395-5 ORIGINAL ARTICLE Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts Achmad P. Rifai 1 & Siti Zawiah Md Dawal 1 &

More information

Modeling and optimization of ATM cash replenishment

Modeling and optimization of ATM cash replenishment Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk

More information

Genetic Algorithms-Based Model for Multi-Project Human Resource Allocation

Genetic Algorithms-Based Model for Multi-Project Human Resource Allocation Genetic Algorithms-Based Model for Multi-Project Human Resource Allocation Abstract Jing Ai Shijiazhuang University of Applied Technology, Shijiazhuang 050081, China With the constant development of computer

More information

Optimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost

Optimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost International Journal of Applied Science-Research and Review (IJAS) www.ijas.org.uk Original Article Optimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost Deepak Gupta

More information

TASK SCHEDULING OF AGV IN FMS USING NON-TRADITIONAL OPTIMIZATION TECHNIQUES

TASK SCHEDULING OF AGV IN FMS USING NON-TRADITIONAL OPTIMIZATION TECHNIQUES ISSN 1726-4529 Int j simul model 9 (2010) 1, 28-39 Original scientific paper TASK SCHEDULING OF AGV IN FMS USING NON-TRADITIONAL OPTIMIZATION TECHNIQUES Udhayakumar, P. & Kumanan, S. Department of Production

More information

arxiv: v1 [cs.ai] 5 Sep 2008

arxiv: v1 [cs.ai] 5 Sep 2008 MIC2005: The Sixth Metaheuristics International Conference??-1 MOOPPS: An Optimization System for Multi Objective Production Scheduling Martin J. Geiger Lehrstuhl für Industriebetriebslehre (510A), Universität

More information

Product Assembly Sequence Optimization Based on Genetic Algorithm

Product Assembly Sequence Optimization Based on Genetic Algorithm Product Assembly Sequence Optimization Based on Genetic Algorithm Azman Yasin 1, Nurnasran Puteh 2 College of Arts and Sciences University Utara Malaysia Sintok, Kedah, Malaysia 1 yazman@uum.edu.my, 2

More information

DEADLOCK AVOIDANCE AND RE-ROUTING OF AUTOMATED GUIDED VEHICLES (AGVS) IN FLEXIBLE MANUFACTURING SYSTEMS (FMS)

DEADLOCK AVOIDANCE AND RE-ROUTING OF AUTOMATED GUIDED VEHICLES (AGVS) IN FLEXIBLE MANUFACTURING SYSTEMS (FMS) DEADLOCK AVOIDANCE AND RE-ROUTING OF AUTOMATED GUIDED VEHICLES (AGVS) IN FLEXIBLE MANUFACTURING SYSTEMS (FMS) MD. Saddam Hussain 1, B. Satish Kumar 2, Dr. G.Janardhana Raju 3 Email: 1 Saddam.mohd321@gmail.com,

More information

An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem

An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem Send Orders for Reprints to reprints@benthamscience.ae 560 The Open Cybernetics & Systemics Journal, 2014, 8, 560-565 Open Access An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem

More information

CHAPTER 1. Basic Concepts on Planning and Scheduling

CHAPTER 1. Basic Concepts on Planning and Scheduling CHAPTER 1 Basic Concepts on Planning and Scheduling Eugénio Oliveira Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the and ordering of activities as well

More information

SCHEDULING PROBLEMS FOR JOBS AND DIFFERENT MACHINES WITH MAKE SPAN CRITERION AND LEFT TIME ALIGNMENT

SCHEDULING PROBLEMS FOR JOBS AND DIFFERENT MACHINES WITH MAKE SPAN CRITERION AND LEFT TIME ALIGNMENT Mechanical Testing and Diagnosis ISSN 47 9635, (IV), Volume 3, pp. 3- SCHEDULING PROBLEMS FOR JOBS AND DIFFERENT MACHINES WITH MAKE SPAN CRITERION AND LEFT TIME ALIGNMENT Daniel REZMIRES*, Alfredo MONFARDINI**,

More information

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur... What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually

More information

Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search

Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search Integrated Process Planning and Scheduling for a Complex Job Shop Using a Proxy Based Local Search Andrew J. Henry Dissertation submitted to the faculty of the Virginia Polytechnic Institute and State

More information

JOB SEQUENCING PROBLEM IN A SEMI-AUTOMATED PRODUCTION PROCESS

JOB SEQUENCING PROBLEM IN A SEMI-AUTOMATED PRODUCTION PROCESS JOB SEQUENCING PROBLEM IN A SEMI-AUTOMATED PRODUCTION PROCESS Roberto Mosca Filippo Queirolo Flavio Tonelli Department of Production Engineering University of Genoa Via all Opera Pia 5, I-645 Genoa, Italy

More information

Artificial Immune System algorithm for multi objective flow shop scheduling problem

Artificial Immune System algorithm for multi objective flow shop scheduling problem ISSN (Online) : 2319-8753 ISSN (Print) : 2347 6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference

More information

Frequency Analysis of Genesis Risk In Construction Projects

Frequency Analysis of Genesis Risk In Construction Projects IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE) e-issn: 78-684 Volume 5, Issue 6 (Mar. - Apr. 03), PP 45-5 Frequency Analysis of Genesis Risk In Construction Projects Anita Rauzana (Staff

More information

Simulation-based Smart Operation Management System for Semiconductor Manufacturing

Simulation-based Smart Operation Management System for Semiconductor Manufacturing Simulation-based Smart Operation Management System for Semiconductor Manufacturing Byoung K. Choi 1*, and Byung H. Kim 2 1 Dept of Industrial & Systems Engineering, KAIST, Yuseong-gu, Daejeon, Republic

More information

Using Genetic Algorithms for Dynamic Scheduling

Using Genetic Algorithms for Dynamic Scheduling Using Genetic Algorithms for Dynamic Scheduling Ana Madureira * Carlos Ramos * Sílvio do Carmo Silva anamadur@dei.isep.ipp.pt,, csr@dei.isep.ipp.pt, scarmo@dps.uminho.pt 1 Institute of Engineering Polytechnic

More information

RFID, Web-Based, and Artificial Intelligence Integration in Facilities Management

RFID, Web-Based, and Artificial Intelligence Integration in Facilities Management RFID, Web-Based, and Artificial Intelligence Integration in Facilities Management Chien-Ho Ko Department of Civil Engineering, National Pingtung University of Science and Technology, Taiwan E-mail: ko@mailnpustedutw

More information

Slack Assessment of the Real Time Scheduling Algorithms

Slack Assessment of the Real Time Scheduling Algorithms International Journal of Control Theory and Applications ISSN : 0974-5572 International Science Press Volume 9 Number 43 2016 Slack Assessment of the Real Time Scheduling Algorithms P. Ramesh a and Uppu

More information

Solving Process Planning, ATC Scheduling and Due-date Assignment Problems Concurrently Using Genetic Algorithm for Weighted Customers

Solving Process Planning, ATC Scheduling and Due-date Assignment Problems Concurrently Using Genetic Algorithm for Weighted Customers 2016 Published in 4th International Symposium on Innovative Technologies in Engineering and Science 3-5 November 2016 (ISITES2016 Alanya/Antalya - Turkey) Solving Process Planning, ATC Scheduling and Due-date

More information