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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 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 Engineering, Universiti Teknologi Malaysia, UTM Johor Bahru, Malaysia 2 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, UTM Johor Bahru, Malaysia Abstract Flexible job shop scheduling has been noticed as an effective manufacturing system to cope with rapid development in today s competitive environment. Flexible job shop scheduling problem (FJSSP) is known as a NP-hard problem in the field of optimization. Considering the dynamic state of the real world makes this problem more and more complicated. Most studies in the field of FJSSP have only focused on minimizing the total makespan. In this paper, a mathematical model for FJSSP has been developed. The objective function is maximizing the total profit while meeting some constraints. Time-varying raw material costs and selling prices and dissimilar demands for each period, have been considered to decrease gaps between reality and the model. A manufacturer that produces various parts of gas valves has been used as a case study. Its scheduling problem for multi-part, multi-period, and multi-operation with parallel machines has been solved by using genetic algorithm (GA). The best obtained answer determines the economic amount of production by different machines that belong to predefined operations for each part to satisfy customer demand in each period. Keywords: Flexible Job-Shop Scheduling, Optimization, Flexible Manufacturing System, Integer Programming, Genetic Algorithm. 1. Introduction Scheduling is significantly investigated in manufacturing systems. Scheduling has been applied to meet customer demand, which plays an important role in customer satisfaction. Additionally, providing a better schedule influences a system s performance. Sequencing and Scheduling are usually considered as a synonym. Conway, Maxwell, and Miller [1] stated that sequencing problem occurs when there is an order in the number of tasks that must be performed. Baker [2] defined sequencing problem as a particular scheduling problem in which a series of tasks entirely establishes a schedule. The sequence is defined as a permutation of N tasks on specified machines [3]. The job-shop scheduling problem (JSSP) is a general scheduling problem in the manufacturing industry. A classical JSSP consists of N and M number of different jobs and machines, respectively. A set of operations and related machines with known processing time are involved in the process of each job. JSSP is a sequencing problem with no machine substitute for each operation while in FJSSP, alternative machines are considered for each operation. Due to the NP-hard class of FJSSP, meta-heuristic approaches have been widely utilized to solve it. Pezzella, Morganti, and Ciaschetti [4] proposed a genetic algorithm (GA) for solving FJSSP and proved that GA can solve the problem more effectively than tabu search. A GA-based heuristic algorithm has been utilized to solve an integrated scheduling problem consisting of job shop, flow shop and production line [5]. Özgüven, Özbakır, and Yavuz [6] defined routing flexibility as the existence of alternative machines for each operation and process plan flexibility as the existence substitute process plans for each job and developed a mixed-integer linear programming model for FJSSP with routing and process plan flexibility. Fattahi and Fallahi [7] developed a multi objective mathematical model for dynamic FJSSP and solved it using a GA-based algorithm. Li and Chen [8] suggested a new chromosome structure with two rows for machine distribution and working sequence and designed the relevant GA operators. Zhang, et al. [9] improved GA to generate a better initial population and suggested an enhanced chromosome structure for solving FJSSP more conveniently. Savaş [10] suggested a GA with novel operations in order to find the minimum makespan in a scheduling problem with dissimilar parallel machines. Chen, Wu, Chen, and Chen, [11] proposed FJSSP with parallel machines and used GA to select machine and sequence of operations for each machine. Majority of previous studies tried to minimize the makespan by selecting the appropriate machine for each operation. In this paper, the objective function is maximizing the total profit by: Determining the amount of production in normal time and overtime. The remainder of this paper are structured as follows: Section 2: Description of proposed model, Section 3: Genetic algorithm, Section 4: Case study, Section 5: Result's interpretation, Section 6: Concluding remarks.

2 2. Problem Description In this paper, an integer mathematical model is proposed to solve FJSSP over a finite time horizon. The objective function is to maximize total profit. Several operations must be performed in order to complete a particular part. Parallel machines have been defined for each operation. All predefined machines for each operation can participate in production. Furthermore, by assuming time-varying costs of raw materials and fluctuating selling prices of completed parts, the optimum answer satisfies the customer demand, by holding the economic amount of inventory. Moreover, overproduction will be sold less than the selling price at the end of the time horizon. 2.1 Assumptions of the model To solve this problem, some assumptions have been made: 2.2 Indices Parts have numerous operations, which have to be completed before shipment to the final store. Alternative machines have been considered for each operation. Customer demand, selling price and cost of each raw material are not constant and can be estimated in the beginning of time horizon. Machines normal time and overtime are constant and out sourcing is not done. There is no back order. The holding cost is constant at all time. Demand can be fulfilled with inventory from the previous period. General purpose machines are assumed. There is no waste for each operation. It means that all non-conforming items can be reworked. Work-in-process inventory is not allowed. It means that parts can only be held when all operations in their processes have been finished. D it C ikj Demand for part i in period t Cost of the k th operation for part i by using the machine type j in normal time (\$/min) C + ikj Cost of the k th operation of part i by using the machine type j in overtime (\$/min) S it Selling price for part i in period t (\$) S' i Selling price for part i at the end of time horizon (\$) P ikj Process time of the k th operation of part i by using machine type j (min) B jt Normal time capacity of machine j in period t (min/month) B + jt Overtime capacity of machine j in period t (min/month) W i Weight of part i (kg) RP it Raw material cost for part I in period t (\$/kg) Holding cost for part i (\$/unit per period) H i 1 if machine j is assigned to the k th operation for part i Y ikj 0 otherwise, 2.4 Decision variables The decision variables of this mathematical model have been defined as follow: X X' Amount of part i that will be created after the k th operation of its process route by machine j in period t and in normal time. Amount of part i that will be created after the k th operation of its process route by machine j in period t in overtime. 2.5 Mathematical model By considering the above notations, the created model is: The below indices have been defined for model formulation. i j k t index for part types (i = 1,...,P) index for machine types (j = 1,...,M) index for number of operation for each part (k = 1,...,K i ) index for periods (t = 1,...,T) 2.3 Input Parameters The required input parameters are:

3 P T i = 1 t = 1 p T Ki M / / i = 1 t = 1 k= 1 j = 1 P Ki M T Max z = D it S it + ([(X + Xl )/K i ] - D it ) l - X Y ikj P ikj C ikj i = 1 k = 1 j = 1 t = 1 P Ki M T - Xl Y ikj P ikj i = 1 k = 1 j = 1 t = 1 p Ki M T C + ikj S i - [( X + Xl )/K i ] W i RP it i = 1 k = 1 j = 1 t = 1 p T Ki M / / - ([(X + Xl )/K i ] - D it ) H i i = 1 t = 1 k = 1 j = 1 S.t. (1) 1 X + X' = 1 X i(k+1)jt + X' i(k+1)jt i 1, 2... P, k 1, 2... K i 1, t 1, 2... T (2) 1 1 (X + X' ) Y ikj D it i 1, 2... P, k 1, 2... K i, t 1, 2... T (3) X P ikj Y ikj B jt j 1, 2... M, t 1, 2... T (4) 1 X' P ikj Y ikj B + jt j 1, 2... M, t 1, 2... T (5) all operations. Eq. (3) indicates that the amount of parts produced must satisfy the demand. Eq. (4) and Eq. (5) consider the machine capacity limitations during normal time and overtime. Eq. (6) indicates that X and X' are integer decision variables. 3. Genetic Algorithm This kind of problem is known as NP-hard problem that can be solved more efficiently with GA and other metaheuristic methods. In this study, GA was selected to solve it. The major mechanisms of GA are: 1. Creating the chromosome representation, 2. Creating the primary population, 3. Creating the adjustment function for fitness evaluation, 4. Defining the selection strategy, 5. Selecting genetic operators for creating a new generation, 6. Defining the parameter values 3.1 Chromosome Structure An array of direct values, has been used to form a chromosome with the length of sum (K i * T) for each working state (normal/overtime), since the total length of a chromosome is 2 * sum (K i * T). There is also a set of subchromosomes for each of them that is related to alternative machines with the length of number of available machines for performing each operation. The value of genes indicates the amount of production. Fig. 1 shows an example for the structure of the proposed chromosome for one part and one period when there are two operations for completing this part, and machine M1 is related to the first operation and machines M3 and M6 are assigned to the second operation. M1 M3 M6 M1 M3 M6 X, X' Integer i 1, 2... P, j 1,2 M, k 1, 2 K i, t 1, 2 T (6) Operation 1 Operation 2 Operation 1 Operation 2 In the above model, Eq. (1) is the objective function, which represents the total profit. The first and second terms calculate the gross profit of sales in each period and at the end of the time period, respectively. The third and fourth terms compute the total operation cost in normal and overtime. The fifth term determines the total cost of raw materials while the last term in the objective function calculates the holding cost. Since, the amount of each part is transferred between the operations of part s process, in the second, fifth and sixth terms of objective function, the summation of these amounts has been divided by the number of operations for each part. Eq. (2) provides a restriction that the amount of each part remains constant in Normal time Overtime Fig. 1 The Structure of Proposed Chromosome 3.2 Selection Strategy The tournament method has been utilized as the selection strategy in this paper. This method randomly selects the number of individuals equal to the tournament size, and then chooses the best individual out of that set to be a parent.

4 3.3 Genetic Operators The following procedure describes the crossover operation of GA: The algorithm generates two random integers m and n between 1 and the length of the chromosome and chooses genes numbered less than or equal to m from the first parent, selects genes numbered from m+1 to n from the second parent, and selects genes numbered greater than n from the first parent. The algorithm then merges these genes to form a single chromosome. The mutation is performed in two steps. First, the algorithm generates a random number between 0 and 1 and assigns them to genes of each chromosome. Wherever this number is less than or equal to the mutation probability, the related gene will be chosen for mutation. In the second step, the algorithm substitutes each selected gene by a random number selected uniformly from the range. 3.4 Termination Criteria The algorithm will be stopped if it reaches a specified maximum number of generations or if it reaches a specified maximum number of iterations without any improvement. Table 3: Raw Material Cost for each Part Part RP it (\$) t = 1 t = 2 t = 3 Part Part Part Table 4: List of Alternative Machines and Related Process Time for the Part s Operation Part (i) Operation(k) Machine(j) P ikj (min) Part 1 1 1,2,3 0.5, 0.5, 0.3 Part 1 2 4,5,6,7 1.2, 1.4, 1.5, 1 Part 1 3 8,9 1.5, 1 Part 2 1 4,5,6,7 1.3, 1.5, 1.6, 1.1 Part 2 2 8,9 2.5, 2 Part 3 1 8,9 1, 2 Part 3 2 4,5,6,7 0.6, 0.8, 0.9, 0.4 Part 3 3 4,5,6,7 0.8, 0.9, 1, Case Study The selected case study produces some parts of industrial valves. Table 1 shows the parts weight and demand in the second and third columns. Table 2 and Table 3 show the selling price of part and cost of raw materials that have been forecasted for three periods. Table 4 shows the operations of parts processes and substitute machines for each operation. The last column demonstrates the related process time for these alternative machines. The machines available time and associated operation cost are presented in Table 5. Furthermore, the holding cost is 0.1 dollar per month per unit. Table 5: Machine s Available Time and Operation Cost in Normal time and Overtime Machine Operation B jt B + jt C ikj C + ikj Type (min/month) (min/month) (\$/min) (\$/min) M M2 Shot Blast M M M CNC M M M Assembly M Table 1: Weight and Demand for each Part Part W i (Kg) D it t = 1 t = 2 t = 3 Part Part Part Table 2: Selling Price for each Part Part S it (\$) S' i (\$) t = 1 t = 2 t = 3 Part Part Part Computational Results The proposed problem has been solved using Matlab software version R2011b and implemented in an Intel Core i5 CPU 2.53 GHz with a 6 GB memory and Windows 7-based operation system. The results based on 0.9 crossover rate, 0.05 mutation rate and 5,000 generations have been collected in Table 6 to Table 8. The objective function was \$ Table 6 shows the obtained answer in the first period. The fourth column indicates the amount of production for each part by different machines of each operation in normal time while the fifth column reveals the amount of production in overtime. The next column shows the summation of production by different machines of each operation for each part in normal time and overtime. Since it has been

5 defined in Eq. (2), these amounts remain equal in different operations for each part. The next column shows the part demand in the first period while the last column shows the amount of overproduction in the first period. The overproduction amounts must be held for future demands of the next period and they are shown as I it in Table 7 and Table 8. Table 7 and Table 8 demonstrate the final solution for the second and third periods. Table 6: Final Results for the First Period Part Operation Machine X X' X + X' D it (X + X' ) - D it (i) (k) (j) (t = 1) (t = 1) Part 1 1 1,2,3 (1304), (1404), (654) (511), (430), (414) 4717 Part 1 2 4,5,6,7 (1587), (1004), (489), (555) (211), (157), (352), (362 ) Part 1 3 8,9 (1377),(1340) (707),(1293) 4717 Part 2 1 4,5,6,7 (765), (461), (434), (695) ( 158), (433), (137), (417) Part 2 2 8,9 (1463),(1531) (280),(226) 3500 Part 3 1 8,9 (1312),(1468) (269),(111) 3160 Part 3 2 4,5,6,7 (767), (442), (266), (230) (730 ), (122), (135), (468) Part 3 3 4,5,6,7 ( 608), (949),(506), (297) (417), (210), (151), (22) 3160 Table 7: Final Results for the Second Period Part Operation Machine X X' X + X' I i1 D it I i2 (i) (k) (j) (t = 2) (t = 2) Part 1 1 1,2,3 (613), (601), (931) (621), (674), (723) 4163 Part 1 2 4,5,6,7 (428), (744), (986), (388) (892), (405), (4), (316) Part 1 3 8,9 (1088),(1355) (370),(1350) 4163 Part 2 1 4,5,6,7 (650), (50), (85), (201) (278), (584), (403), (249) Part 2 2 8,9 (1560),(766) (89),(85) 2500 Part 3 1 8,9 (721),(1151) (790),(27) 2689 Part 3 2 4,5,6,7 (119), (432), (10), (496) (274), (245), (504), (609) Part 3 3 4,5,6,7 (425), (737), (769), (245) (196 ), (47), (58), (212) 2689 Table 8: Final Results for the Third Period Part Operation Machine X X' X + X' I i2 D it I i3 (i) (k) (j) (t = 3) (t = 3) Part 1 1 1,2,3 (146), (891), (357) (967), (730), (1031) 4122 Part 1 2 4,5,6,7 (1037), (582), (187), (432) (543), (788), (365), (188) Part 1 3 8,9 (1431),(926) (1003),(762) 4122 Part 2 1 4,5,6,7 (518), (219), (41), (500) (109), (537), (646), (183) Part 2 2 8,9 (1363),(1317) (73),(0) 2753 Part 3 1 8,9 (936),(1492) (27),(496) 2951 Part 3 2 4,5,6,7 (165 ), (351), (1306), (66) (38), (247), (470), (308) Part 3 3 4,5,6,7 (598), (133), (161), (73) (450), (340), (156), (1040) 2951

6 6. Conclusions In this paper, an integer mathematical model has been developed to solve FJSSP with time-varying demands, fluctuating raw material costs and different selling prices over the finite time planning horizon. The objective function was maximizing the total profit while meeting some constraints. A GA solver was programmed using Matlab software version R2011b to solve this model. A computational study has been conducted for an industrial case company which produces some parts of industrial gas valves. The obtained results were acceptable and all constraints have been satisfied. Sayedmohammadreza Vaghefinezhad received Master of Engineering degree (Industrial Engineering) from UTM. He graduated in B.S course in the field of Industrial Engineering (Industrial Production) at Sharif University of Technology. His current research interests include operations research, simulation of operations, production and operations management, modeling and analysis of operation systems, evolutionary algorithms, and computer programming languages. Kuan Yew Wong holds a PhD from the University of Birmingham, England. Currently, he heads the Industrial Engineering Laboratory at Universiti Teknologi Malaysia (UTM). His research interests are related to operations management and industrial engineering. Acknowledgment Authors would like to appreciate the Case Study Company and Universiti Teknologi Malaysia for their support and assistance. References [1] RW. Conway, WL. Maxwell, and LW. Miller, Theory of Scheduling, Massachusetts: Addison-Wesley Publishing Company, [2] KR. Baker, Introduction to Sequencing and Scheduling, New York: John Wiley & Sons, [3] M. Pinedo, Scheduling: Theory, algorithms, and systems, 2nd ed. New Jersey: Prentice-Hall Inc., [4] F. Pezzella, G. Morganti, and G. Ciaschetti, A genetic algorithm for the Flexible Job-shop Scheduling Problem, Computers & Operations Research, vol. 35, no. 10, 2008, pp [5] H. Yan and X. Zhang, A Case Study on Integrated Production Planning and Scheduling in a Three-Stage Manufacturing System, IEEE Transactions on Automation Science and Engineering, vol. 4, no. 1, 2007, pp [6] C. Özgüven, L. Özbakır, and Y. Yavuz, Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Applied Mathematical Modelling, vol. 34, no. 6, 2010, pp [7] P. Fattahi and A. Fallahi, Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability, CIRP Journal of Manufacturing Science and Technology, vol. 2, no. 2, 2010, pp [8] Y. Li and Y. Chen, A Genetic Algorithm for Job-Shop Scheduling, Journal of Software, vol. 5, no. 3, 2010, pp [9] G. Zhang, L. Gao, Y. Shi, An effective genetic algorithm for the flexible job-shop scheduling problem, Expert Systems with Applications, vol. 38, 2011, pp [10] B. Savaş, Non-identical parallel machine scheduling using genetic algorithm, Expert Systems with Applications, vol. 38, 2011, pp [11] J. C. Chen, J.-J. Wu, C.-W. Chen, and K.-H. Chen, Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm, Expert Systems with Applications, 2012.

### 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

### 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

### 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

HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu

### A Hybrid Tabu Search Method for Assembly Line Balancing

Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization, Beijing, China, September 15-17, 2007 443 A Hybrid Tabu Search Method for Assembly Line Balancing SUPAPORN

### 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

### SOLVING JOB SHOP SCHEDULING WITH THE COMPUTER SIMULATION

The International Journal of TRANSPORT & LOGISTICS Medzinárodný časopis DOPRAVA A LOGISTIKA ISSN 1451-107X SOLVING JOB SHOP SCHEDULING WITH THE COMPUTER SIMULATION 1 Tomas Kloud 1, Frantisek Koblasa 2

### An improved Evolutionary Algorithm to sequence operations on an ASRS warehouse

An improved Evolutionary Algorithm to sequence operations on an ASRS warehouse José A. Oliveira, João Ferreira, Guilherme A.B. Pereira and Luis S. Dias Centre ALGORITMI, University of Minho, Portugal zan@dps.uminho.pt,

### International Journal of Advances in Science and Technology (IJAST)

Determination of Economic Production Quantity with Regard to Machine Failure Mohammadali Pirayesh 1, Mahsa Yavari 2 1,2 Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University

### A Brief Study of the Nurse Scheduling Problem (NSP)

A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the

### 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

### 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

### Keywords revenue management, yield management, genetic algorithm, airline reservation

Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Revenue Management

### A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0

212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order

### Standardization and Its Effects on K-Means Clustering Algorithm

Research Journal of Applied Sciences, Engineering and Technology 6(7): 399-3303, 03 ISSN: 040-7459; e-issn: 040-7467 Maxwell Scientific Organization, 03 Submitted: January 3, 03 Accepted: February 5, 03

### Index Terms- Batch Scheduling, Evolutionary Algorithms, Multiobjective Optimization, NSGA-II.

Batch Scheduling By Evolutionary Algorithms for Multiobjective Optimization Charmi B. Desai, Narendra M. Patel L.D. College of Engineering, Ahmedabad Abstract - Multi-objective optimization problems are

### Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm

Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College

### Nonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms

Nonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms Al-Duwaish H. and Naeem, Wasif Electrical Engineering Department/King Fahd University of Petroleum and Minerals

### Research Article Service Composition Optimization Using Differential Evolution and Opposition-based Learning

Research Journal of Applied Sciences, Engineering and Technology 11(2): 229-234, 2015 ISSN: 2040-7459; e-issn: 2040-7467 2015 Maxwell Scientific Publication Corp. Submitted: May 20, 2015 Accepted: June

### Genetic Algorithm Based Interconnection Network Topology Optimization Analysis

Genetic Algorithm Based Interconnection Network Topology Optimization Analysis 1 WANG Peng, 2 Wang XueFei, 3 Wu YaMing 1,3 College of Information Engineering, Suihua University, Suihua Heilongjiang, 152061

### 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

### STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1

STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 somanprajakta@gmail.com,

### A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution. Bartosz Sawik

Decision Making in Manufacturing and Services Vol. 4 2010 No. 1 2 pp. 37 46 A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution Bartosz Sawik Abstract.

### Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling

Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling R.G. Babukartik 1, P. Dhavachelvan 1 1 Department of Computer Science, Pondicherry University, Pondicherry, India {r.g.babukarthik,

### A MULTI-PERIOD INVESTMENT SELECTION MODEL FOR STRATEGIC RAILWAY CAPACITY PLANNING

A MULTI-PERIOD INVESTMENT SELECTION MODEL FOR STRATEGIC RAILWAY Yung-Cheng (Rex) Lai, Assistant Professor, Department of Civil Engineering, National Taiwan University, Rm 313, Civil Engineering Building,

### Effects of Symbiotic Evolution in Genetic Algorithms for Job-Shop Scheduling

Proceedings of the th Hawaii International Conference on System Sciences - 00 Effects of Symbiotic Evolution in Genetic Algorithms for Job-Shop Scheduling Yasuhiro Tsujimura Yuichiro Mafune Mitsuo Gen

### Simulating the Multiple Time-Period Arrival in Yield Management

Simulating the Multiple Time-Period Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2

### 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

### 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

### Spare Parts Inventory Model for Auto Mobile Sector Using Genetic Algorithm

Parts Inventory Model for Auto Mobile Sector Using Genetic Algorithm S. Godwin Barnabas, I. Ambrose Edward, and S.Thandeeswaran Abstract In this paper the objective is to determine the optimal allocation

### Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization

182 IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.3, March 2010 Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization P.Radhakrishnan

### A Fast Computational Genetic Algorithm for Economic Load Dispatch

A Fast Computational Genetic Algorithm for Economic Load Dispatch M.Sailaja Kumari 1, M.Sydulu 2 Email: 1 Sailaja_matam@Yahoo.com 1, 2 Department of Electrical Engineering National Institute of Technology,

### Agenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization

Agenda Supply Chain Optimization KUBO Mikio Definition of the Supply Chain (SC) and Logistics Decision Levels of the SC Classification of Basic Models in the SC Logistics Network Design Production Planning

### Duplicating and its Applications in Batch Scheduling

Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China

### Two objective functions for a real life Split Delivery Vehicle Routing Problem

International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry

### 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

Using Business Intelligence to Mitigate Graduation Delay Issues Khaled Almgren PhD Candidate Department of Computer science and Engineering University of Bridgeport Abstract Graduate master students usually

### Optimizing Machine Allocation in Semiconductor Manufacturing Capacity Planning using. Bio-Inspired Approaches

Optimizing Machine Allocation in Semiconductor Manufacturing Capacity Planning using Umi Kalsom Yusof School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia umiyusof@cs.usm.my

### Numerical Research on Distributed Genetic Algorithm with Redundant

Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,

### Effect of Using Neural Networks in GA-Based School Timetabling

Effect of Using Neural Networks in GA-Based School Timetabling JANIS ZUTERS Department of Computer Science University of Latvia Raina bulv. 19, Riga, LV-1050 LATVIA janis.zuters@lu.lv Abstract: - The school

### International Journal of Software and Web Sciences (IJSWS) www.iasir.net

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

### Genetic Algorithms. Part 2: The Knapsack Problem. Spring 2009 Instructor: Dr. Masoud Yaghini

Genetic Algorithms Part 2: The Knapsack Problem Spring 2009 Instructor: Dr. Masoud Yaghini Outline Genetic Algorithms: Part 2 Problem Definition Representations Fitness Function Handling of Constraints

### Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem

Genetic Algorithm based Approach to Solve Non Fractional (0/1) Knapsack Optimization Problem Vikas Thada Asst. Prof (CSE), ASET, Amity University, Gurgaon, India Shivali Dhaka Asst. Prof (CSE), ASET, Amity

### The Applications of Genetic Algorithms in Stock Market Data Mining Optimisation

The Applications of Genetic Algorithms in Stock Market Data Mining Optimisation Li Lin, Longbing Cao, Jiaqi Wang, Chengqi Zhang Faculty of Information Technology, University of Technology, Sydney, NSW

### A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation

A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation Abhishek Singh Department of Information Technology Amity School of Engineering and Technology Amity

### Demand Forecasting Optimization in Supply Chain

2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V52.12 Demand Forecasting Optimization

### A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization

AUTOMATYKA 2009 Tom 3 Zeszyt 2 Bartosz Sawik* A Weighted-Sum Mixed Integer Program for Bi-Objective Dynamic Portfolio Optimization. Introduction The optimal security selection is a classical portfolio

### Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level

Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level Faicel Hnaien, Xavier Delorme 2, and Alexandre Dolgui 2 LIMOS,

### 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

### A Service Revenue-oriented Task Scheduling Model of Cloud Computing

Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,

### Genetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction

Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules

### A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS

A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS Mahdi Abbasi Iranagh 1 and Rifat Sonmez 2 Dept. of Civil Engrg, Middle East Technical University, Ankara, 06800, Turkey Critical path

### A hybrid genetic algorithm approach to mixed-model assembly line balancing

Int J Adv Manuf Technol (2006) 28: 337 341 DOI 10.1007/s00170-004-2373-3 O R I G I N A L A R T I C L E A. Noorul Haq J. Jayaprakash K. Rengarajan A hybrid genetic algorithm approach to mixed-model assembly

### A Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems

BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 2 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0025 A Survey of Solving Approaches

### 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

### An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment

IJCSC VOLUME 5 NUMBER 2 JULY-SEPT 2014 PP. 110-115 ISSN-0973-7391 An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment 1 Sourabh Budhiraja,

### Development of a Web-Based Decision Support System for Cell Formation Problems Considering Alternative Process Routings and Machine Sequences

J. Software Engineering & Applications, 2010, 3: 160-166 doi:10.4236/jsea.2010.32020 Published Online February 2010 (http://www.scirp.org/journal/jsea) Development of a Web-Based Decision Support System

### SIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT

CHAPTER 8 SIMULATING CANCELLATIONS AND OVERBOOKING IN YIELD MANAGEMENT In YM, one of the major problems in maximizing revenue is the number of cancellations. In industries implementing YM this is very

### Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information

Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering

### Web based Multi Product Inventory Optimization using Genetic Algorithm

Web based Multi Product Inventory Optimization using Genetic Algorithm Priya P Research Scholar, Dept of computer science, Bharathiar University, Coimbatore Dr.K.Iyakutti Senior Professor, Madurai Kamarajar

### 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

### 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

### New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem

New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem Radovic, Marija; and Milutinovic, Veljko Abstract One of the algorithms used for solving Traveling Salesman

### Hybrid Data Envelopment Analysis and Neural Networks for Suppliers Efficiency Prediction and Ranking

1 st International Conference of Recent Trends in Information and Communication Technologies Hybrid Data Envelopment Analysis and Neural Networks for Suppliers Efficiency Prediction and Ranking Mohammadreza

### An Improved ACO Algorithm for Multicast Routing

An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China wzqagent@xinhuanet.com

### Performance Analysis of Job-Shop Production Systems under Different Order Release Control Parameters

Performance Analysis of Job-Shop Production Systems under Different Order Release Control Parameters Paulo S. A. Sousa and Maria R. A. Moreira Abstract Controlling the flow of materials inside job-shops

### 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

### 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

### Integer Programming: Algorithms - 3

Week 9 Integer Programming: Algorithms - 3 OPR 992 Applied Mathematical Programming OPR 992 - Applied Mathematical Programming - p. 1/12 Dantzig-Wolfe Reformulation Example Strength of the Linear Programming

### AN OPTIMAL STRATEGY FOR YARD TRUCKS MANAGEMENT IN HONG KONG CONTAINER TERMINALS

AN OPTIMAL STRATEGY FOR YARD TRUCKS MANAGEMENT IN HONG KONG CONTAINER TERMINALS Z. X. Wang Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hong Kong E-mail: jeremy.wang@connect.polyu.hk

### Available online at www.sciencedirect.com. ScienceDirect. Procedia CIRP 40 (2016 ) 390 395

Available online at www.sciencedirect.com ScienceDirect Procedia CIRP 40 (2016 ) 390 395 13th Global Conference on Sustainable Manufacturing - Decoupling Growth from Resource Use A Heuristic Approach to

### Issues in Information Systems Volume 14, Issue 2, pp.353-358, 2013

A MODEL FOR SIMULTANEOUS DECISIONS ON MASTER PRODUCTION SCHEDULING, LOT SIZING, AND CAPACITY REQUIREMENTS PLANNING Harish C. Bahl, California State University-Chico, hbahl@csuchico.edu Neelam Bahl, California

### A Robust Method for Solving Transcendental Equations

www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,

### WITH the growing economy, the increasing amount of disposed

IEEE TRANSACTIONS ON ELECTRONICS PACKAGING MANUFACTURING, VOL. 30, NO. 2, APRIL 2007 147 Fast Heuristics for Designing Integrated E-Waste Reverse Logistics Networks I-Lin Wang and Wen-Cheng Yang Abstract

### Makespan Computation for Cyber Manufacturing Centre Using Bottleneck Analysis: A Re-entrant Flow Shop Problem

IMECS 008, 9- March, 008, Hong Kong Makespan Computation for Cyber Manufacturing Centre Using Bottleneck Analysis: A Re-entrant Flow Shop Problem Salleh Ahmad Bareduan and Sulaiman H. Hasan Abstract This

### A Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems. Jia Hu 1 and Ian Flood 2

A Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems Jia Hu 1 and Ian Flood 2 1 Ph.D. student, Rinker School of Building Construction,

### A Review And Evaluations Of Shortest Path Algorithms

A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing

### Optimization of Preventive Maintenance Scheduling in Processing Plants

18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance

### New binary representation in Genetic Algorithms for solving TSP by mapping permutations to a list of ordered numbers

Proceedings of the 5th WSEAS Int Conf on COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS AND CYBERNETICS, Venice, Italy, November 0-, 006 363 New binary representation in Genetic Algorithms for solving

### A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms

2009 International Conference on Adaptive and Intelligent Systems A Comparison of Genotype Representations to Acquire Stock Trading Strategy Using Genetic Algorithms Kazuhiro Matsui Dept. of Computer Science

### An Integrated Production Inventory System for. Perishable Items with Fixed and Linear Backorders

Int. Journal of Math. Analysis, Vol. 8, 2014, no. 32, 1549-1559 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.46176 An Integrated Production Inventory System for Perishable Items with

### Coordinated Pricing and Inventory in A System with Minimum and Maximum Production Constraints

The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 160 165 Coordinated Pricing and Inventory

### 5 Scheduling. Operations Planning and Control

5 Scheduling Operations Planning and Control Some Background Machines (resources) are Machines process jobs (molding machine, x ray machine, server in a restaurant, computer ) Machine Environment Single

### R u t c o r Research R e p o r t. A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS.

R u t c o r Research R e p o r t A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS Navid Hashemian a Béla Vizvári b RRR 3-2011, February 21, 2011 RUTCOR Rutgers

### Comparison of periodic-review inventory control policies. in a serial supply chain

025-0998 Comparison of periodic-review inventory control policies in a serial supply chain Nihan Kabadayi, İstanbul University, Faculty of Business Administration, Production Management Department, Avcılar,

### Management and optimization of multiple supply chains

Management and optimization of multiple supply chains J. Dorn Technische Universität Wien, Institut für Informationssysteme Paniglgasse 16, A-1040 Wien, Austria Phone ++43-1-58801-18426, Fax ++43-1-58801-18494

### CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,

### Comparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments

Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak

### 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

### An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

This is the Pre-Published Version. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines Q.Q. Nong, T.C.E. Cheng, C.T. Ng Department of Mathematics, Ocean

### A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems

IEEE International Conference on Evolutionary Computation May 4-11 1998, Anchorage, Alaska A Reactive Tabu Search for Service Restoration in Electric Power Distribution Systems Sakae Toune, Hiroyuki Fudo,

### Integration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange Crossover

Journal of Computer Science 8 (5): 681-693, 2012 ISSN 1549-3636 2012 Science Publications Integration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange Crossover

### Demand Forecasting and Production Planning for Highly Seasonal Demand Situations: Case Study of a Pressure Container Factory

ScienceAsia 27 (2) : 27-278 Demand Forecasting and Production Planning for Highly Seasonal Demand Situations: Case Study of a Pressure Container Factory Pisal Yenradee a,*, Anulark Pinnoi b and Amnaj Charoenthavornying

### Management of Software Projects with GAs

MIC05: The Sixth Metaheuristics International Conference 1152-1 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad

### An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling

An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling Avinash Mahadik Department Of Computer Engineering Alard College Of Engineering And Management,Marunje, Pune Email-avinash.mahadik5@gmail.com

### SOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD

SOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD Jaya Srivastaval 1 and Twinkle Dwivedi 2 1 Department of Computer Science & Engineering, Shri Ramswaroop Memorial

### A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number

A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp

### A Tool for Generating Partition Schedules of Multiprocessor Systems

A Tool for Generating Partition Schedules of Multiprocessor Systems Hans-Joachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hans-joachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.