An improved Evolutionary Algorithm to sequence operations on an ASRS warehouse
|
|
- Dale Hudson
- 7 years ago
- Views:
Transcription
1 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 WWW home page: Abstract. This paper describes the hybridization of an evolutionary algorithm with a greedy algorithm to solve a job-shop problem with recirculation. We model a real problem that arises within the domain of loads dispatch inside an automatic warehouse. The evolutionary algorithm is based on random key representation. It is very easy to implement and allows the use of conventional genetic operators for combinatorial optimization problems. A greedy algorithm is used to generate active schedules. This constructive algorithm reads the chromosome and decides which operation is scheduled next. This option increases the efficiency of the evolutionary algorithm. The algorithm was tested using some instances of the real problem and computational results are presented. Keywords: Evolutionary algorithms, Job shop scheduling, ASRS warehouse 1 Introduction The efficiency of an automatic storage system depends, among other factors, on the plan for loading operations on trucks. In the AS/RS (Automated Storage and Retrieval System) warehouses, where a large number of truckloads are performed on a daily basis, it is necessary to plan and execute accurately the loading procedures in order to fulfil the delivery deadlines. The issue of AS/RS warehouses has been studied since the 70s, increasing their interest in recent years [1 8]. The problem for sequencing operations in automated warehouses was presented by Oliveira [4, 5], and the problem was modelled as a variant of the job-shop scheduling problem (JSSP). Recently, Figueiredo et al.[8] modelled the problem in which the operations have general processing times and they presented a genetic algorithm to solve the problem. In this paper we describe an evolutionary algorithm that represents an improvement that represents an improvement to the work presented by Figueiredo et al.[8]. In their work the authors present a genetic algorithm to generate nondelay schedules. The authors support their option on the fact that the solution space is shorter than the solution space of active schedules. In this paper we study the hybridization of a Evolutionary Algorithm (EA) with a greedy algorithm to generate active schedules. Although the search space being larger, we show that this EA gets better results, without an increase of CPU time.
2 2 The paper is organized in the following way: next section describes the automatic warehouse type of operations; the third section presents the model adopted, some remarks about its application and also discusses some extensions to the model; the fourth section is dedicated to the characterization of the solution s methodology adopted; the fifth section presents computational results of the developed algorithm; finally the conclusions about the work are discussed. 2 The Storage System The real scheduling problem reported by Oliveira [5] occurs in a AS/SR type automatic warehouse. The AS/RS is formed by several aisles of pallets racks, with capacity about forty thousand pallets. In each aisle operates a stacker crane (also S/R machine). In the retrieval process the S/R machine moves the pallets from their storage position to the collector at the top of the aisle. Next, several forklift trucks move the pallets and place them inside the trucks. According to this process the real problem was modelled as a job-shop scheduling problem with recirculation [4] - that means a job is processed more than once in the same machine. In this case, a load for one truck could receive more than one pallet from the same aisle and the same S/R machine. For details about the warehouse functioning we address the reader to [4, 5]. In the real problem, there are about a hundred loads to dispatch per day (truck loads - also called trips ). The strategy adopted to program the trucks loading consists on defining a partition of the whole load into disjoint subsets of loads, which are processed simultaneously, called batches (blocks). This strategy guarantees that every load of a batch is finished before starting to prepare the loads for the next batch. The batches dimensioning respects the imposed limits, in order to fulfil the delivery deadlines. The number of docking bays limits the maximum number of loads in a batch. A standard workday can originate plans with batches, with 6-13 loads each [8]. Oliveira [5] demonstrated that the time spent to process the batches depends on the number of loads of the batch, and it is calculated based on the nominal values of the system s throughput. It is assumed that the storage system guarantees a nominal flow of pallets dispatch at a constant rate, and therefore it considers that the duration of the batch is proportional to the total number of batches pallets. Figueiredo et al.[8] demonstrated that time to process the batch depends also on the sequence for retrieving the pallets, which is to say, on the S/R machines operations scheduling. Due to precedence constraints between pallets, the order in which the pallets of the batches are retrieved by the S/R machines may lead to different processing times. The problem of establishing the best pallets retrieving operations sequence in each aisle is also an optimization problem, and the authors modelled it as a Job Shop Scheduling Problem (JSSP) with recirculation. In Oliveira [5] there is a detailed description of the process to retrieve the pallets - from the aisle to the truck. Part of the movement is performed by forklifts that are controlled by Radio Frequency. In his work, Oliveira [5] assumes
3 3 identical processing times to transport pallets independently of the location of the aisle and the truck. In this work, a new model considering general processing times is presented, and it takes into account the location of the truck in the docking bays and the aisle where the pallets are retrieved. This model is believed to better representing the real problem, but also turns the associated job shop problem more difficult to solve. 3 Job Shop Scheduling Problem Some Combinatorial Optimization Problems are very hard to solve and therefore require the use of heuristic procedures. One of them is the Job Shop Scheduling Problem. The use of exact methods to solve the JSSP is limited to small size instances. According to Zhang et al.[9] the Branch and Bound methods do not solve instances larger than 250 operations in a reasonable time. The heuristic methods have become very popular and have gained much success in solving job shop scheduling problems. In the last twenty years a huge number of papers has been published, presenting several metaheuristic methods. From Simulated Annealing to Particle Swarm Optimization, there are several variants of the same method class. EAs are very popular among researchers [2, 4, 5, 8, 10 12]. In 1996, Vaessens et al. [13] stated a goal for the Job Shop Problem: to achieve an average error of less than two percent within 1,000 seconds total computation time. In this work the authors presented the Genetic Algorithms as the less effective metaheuristic to solve the JSSP. A possibility to increase the efficiency and the effectiveness is an algorithm that includes specific knowledge of the problem. In the JSSP each job is formed by operations that have to be processed on a set of machines. Each job has a technological definition that determines a specific order to process the job s operations, and it is also necessary to guarantee that there is no overlap, in time, when processing different operations in the same machine; and also that there is no overlap, in time, when processing operations of the same job. The objective of the JSSP is to finish all jobs as soon as possible, that is, to minimize the makespan. The classical JSSP model considers a set of n jobs, and a set of m machines. Each job consists of a set of m operations (one operation on each machine), among which precedence relations exist and that defines a single processing sequence. Each operation is processed in one machine only, during p time units. The instant when the job is concluded is C. All operations are concluded at C max (called makespan). For the convenience of the representation, operations are numbered consecutively from 1 to N, in which N is the total number of operations. The classic model considers that all the jobs are processed once in every machine, and the total number of operations is N =n.m. In a more general model, a job can have a number of operations different from m (number of machines). The case in which a job is processed more than once in the same machine, is called a job shop model with recirculation [4]. The computational and practical significance of JSSP have motivated the attention of researchers for the last several decades.
4 4 The solutions (schedules) for the JSSP can be classified in 3 sets: semi-actives (SA), actives (A) and non-delayed (ND). Typically, these sets have the particularity that A is a proper subset of SA, and ND is a proper subset of A. In relation to the optimal solution of the problem (minimization of C max ), it is known that it is an active schedule but not necessarily a non-delayed schedule. In this work, the solutions obtained from the EA belong to the active set. This choice was taken in order to obtain better solutions. 4 Methodology In this work we adopted a method based on evolutionary algorithms. This technique s simplicity to model complex problems and its easy integration with other optimization methods were factors that were considered for its choice. Traditionally, genetic algorithms used bit string chromosomes. These chromosomes consisted of only 0s and 1s. Modern genetic algorithms more often use problem-specific chromosomes with evidence that the use of real or integer value chromosomes often outperformed bit string chromosomes. The permutation code was adequate to permutation problems. In this kind of representation, the chromosome is a literal of the operations sequence on the machines. For the classical JSSP case, Oliveira [5] presents a chromosome that is composed by m sub-chromosomes, one for each machine, each one composed by n genes, one for each operation. The i gene of the sub-chromosome corresponds to the operation processed in i place in the corresponding machine. The allele identifies the operation s index in the disjunctive graph. Nevertheless, in this work, the random key code presented by Bean [14] is used, attending the easiness to model complex systems with this type of representation, as it is the case to model the loading of trucks in an automatic warehouse. The important feature of random keys is that all offspring formed by the genetic operators are feasible solutions - this occurs when it is used as a constructive procedure based on the available operations to schedule and the priority is given by the random key allele. Another advantage of the random key representation is the possibility of using the conventional genetic operators. This characteristic allows the use of EA with other optimization problems, adapting only a few routines related to the problem. Equally easy becomes the hybridization with other heuristics when a genetic algorithm with random keys is used. Also, it is possible to hybridize with a MIP solver, once the fractional value of a variable could be used as an allele of the random key representation. A chromosome represents a solution to the problem and it is encoded as a vector of random keys (random numbers). In this work, according to Cheng et al. [10], the problem representation is indeed a mix from priority rule-based representation and random keys representation. 4.1 Constructive Algorithm The solutions represented by chromosome are decoded by an algorithm, which is based on Giffler and Thompson s algorithm (GTa)[15]. While the GTa can
5 5 generate all the active plans, the constructive algorithm only generates the plan in agreement with the chromosome. As advantages of this strategy, we pointed out the small dimension of solution space, which includes the optimum solution and the fact that it does not produce impossible or disinteresting solutions from the optimization point of view. On the other hand, since the dimensions between the representation space and the solution space are very different, this option can represent a problem because two chromosomes can represent the same solution. The constructive algorithm has N stages and in each stage an operation is scheduled. To assist the algorithm s presentation, consider the following notation for stage t: P t - the partial schedule of the (t 1) scheduled operations; S t - the set of operations schedulable at stage t, i.e. all the operations that must precede those in S t are in P t ; σ k - the earliest time that operation o k in S t could be started; φ k - the earliest time that operation o k in S t could be finished, that is φ k = σ k +p k and p k is the processing time of operation o k ; M - the selected machine where φ = min ok S t (φ k ); S - the conflict set formed by o k S t processed in M and σ k < φ ; o k - the selected operation to be scheduled at stage t. The constructive algorithm of solutions is presented in Fig. 1 in a similar format to the one used by Cheng et al. [10]. In Step 3 instead of using a priority Step 1 Let t = 1 with P 1 being null. S t will be the set of all operations with no predecessors. Step 2 Find φ = mino k S t { φk} and identify M. Form S t. Step 3 Select operation o t in S t with greatest allele value. Step 4 Move to next stage by (1) adding o t to P t, so creating P t + 1 ; (2) removing o j from S t and creating S t + 1 by adding to S t the operation that directly follows o * t in its job (unless o t completes its job); (3) incrementing t by 1. Step 5 If there are any operations left unscheduled( t < N), go to Step 2. Otherwise, stop. Fig. 1. Algorithm 1 - Constructive algorithm dispatching rule, the information given by the chromosome is used. If the maximum allele value is equal for two or more operations, one is chosen randomly. 4.2 The Evolutionary Algorithm Structure The EA has a very simple structure and can be represented in Algorithm 2, illustrated in Fig. 2. It begins with population generation and her evaluation. Attending to the fitness of the chromosomes the individuals are selected to be
6 6 parents. Comparing the fitness of the new elements and of their progenitors the former population is updated. Step 1 begin Step 2 P GenerateInitialPopulation() Step 3 Evaluate(P) Step 4 while termination conditions not meet do (1) P Select_progenitors(P) (2) P Apply_GeneticOperators(P ) (3) Evaluate(P ) (4) P Select(P P ) Step 5 end while Fig. 2. Algorithm 2 - Evolutionary algorithm On building of the offspring population we implemented an elitist strategy. Firstly, we select the better individuals of the current population to be progenitors, (10%). Then, the remaining parents are chosen by the routines of the roulette wheel (60%) and tournament (30%). So, one individual can be selected more than once to be progenitor. Secondly, we apply the genetic operators over this population according to the following partition: we use the crossover on two parents (40%); the crossover on two parents plus the mutation (30%); and the mutation (30%). The Uniform Crossover (UX) is used in this work. This genetic operator uses a new sequence of random numbers and swaps both progenitors alleles if the random key is greater than a prefixed value. This genetic operator uses a new sequence of random numbers and swaps both progenitors alleles if the random key is greater than a prefixed value. Fig.3 illustrates the UX s application on two parents (prnt1, prnt2), and swaps alleles if the random key is greater or equal to The genes 3 and 4 are changed and it originates two descendants (dscndt1, dscndt2). Descendant 1 is similar to parent 1, because it has about 75% of the genes of this parent. i prnt prnt randkey dscndt dscndt Fig. 3. The UX crossover
7 7 5 Computational Experiments Computational experiments were carried out with some representative instances of the real problem. We use the same representative instances of the real problem presented by Figueiredo et al.[8] that were generated randomly and they concern a job-shop problem with recirculation. The dimension of these instances corresponds to the defined maximum dimension of the real problem. Instances jr 13 1, jr 13 2 are constituted by 13 jobs (docking bay number) and 35 operations per job (one load s dimension), which adds up to a total of 455 operations and 11 machines (number of aisles). The 35 operations of the major part of the jobs are processed in 5 machines. This situation corresponds to the real problem. Usually, the load of a truck (35 pallets) comes from the 5 aisles closer to the docking bay. The recirculation situation happens when a job is processed more than once in the same machine. In the real problem this corresponds to collecting several pallets from the same aisle. Table 1 presents the results of computational experiences, and summarize the results obtained by Figueiredo et al. [8] with non-delay schedules and also the results for our active schedules. Globally an improvement of 1% is obtained by active schedules. Furthermore, for some instances an improvement of 2% and 3% is reached - these instances correspond to greater sizes in terms of number of operations. The algorithm was implemented in C++ and the code was compiled using GNU Compiler Collection (GCC) version The tests were run on a computer Intel i3, with 4 MB of RAM, on the Ubuntu in Windows7 using VirtualBox. The experiments were performed using two different populations - a small one with 20 individuals, and a larger one with 100 individuals. The third column of Table 1 indicates the number of jobs, and column Op. indicates the number of operations. This table presents the best value obtained from 15 runs of each configuration, and the average value of 15 runs. For all experiments 500 iterations were performed. The results are promising, while achieving better solutions in early stages of the optimization process. Also the algorithm proved to be robust and consistent, with similar performances in all experiments considered. With larger populations it is possible to achieve better results since the beginning of the optimization process, although requiring extra CPU time. Despite the code is not yet optimized for calculations speed, a run for the largest instance (jr 13 2), performing 500 iterations takes about 85 seconds with a population size of 100, and about 18 seconds with a population size of 20. Fig. 4 shows these runs - population size 20 and population size 100 for both types of schedules (non delay / active). Fig. 4 also illustrates the advantage of using a larger population (better solutions since the beginning), although this option takes more CPU time. With a population five times bigger the algorithm returns a better result within just 20% of the number of iterations. For this particular run, it is possible to verify that the generation of active schedules outperforms the non-delay schedules generation.
8 8 Table 1. Experimental results NonDelay Schedules Active Schedules Name Pop J Op Best Aver. Worst Best Aver. Worst jr_1_ jr_3_ jr_4_ jr_4_ jr_6_ jr_6_ jr_8_ jr_8_ jr_10_ jr_10_ jr_13_ jr_13_ ND 20ND 100Ac 20Ac Fig. 4. Results for different population sizes
9 9 6 Conclusions This paper presents a model for scheduling load operations in an automatic warehouse and a Evolutionary Algorithm to solve the JSSP with recirculation. The schedules are built using information given by the genetic algorithm to sequence the operations. The algorithm incorporates a constructive algorithm to build the solution from the chromosome, and it always generates feasible plans, and in particular active schedules. This constructive algorithm allows the inclusion of specific knowledge of the problem and makes the algorithm very efficient. This algorithm easily shows the solution for several daily problems that may occur in a warehouse. The algorithm was tested with success on instances of equal dimension of the real problem. The computation time suggests that it is an efficient algorithm, allowing its integration in a decision support system to evaluate different alternatives in useful time. The main advantage in generating active plans is the fact that all schedules are valid in terms of programming the S/R machines, without generating deadlocks. As future developments, we do think it would be beneficial to try using both constructive algorithms. In fact, for some instances the optimal solution is an active schedule, and for other instances it is a non-delay schedule. It is feasible to design an hybrid constructive algorithm. Since the random keys representation has no Lemarkin property it is our intention to develop a variation of random keys representation to avoid this weakness. Acknowledgments. This work was funded by the Programa Operacional Fatores de Competitividade - COMPETE and by the FCT - Fundação para a Ciência e Tecnologia in the scope of the project: FCOMP FEDER References 1. Rashid, M.M., Kasemi, B., Rahman, M.: New Automated Storage and Retrieval System (ASRS) using wireless communications th International Conference on Mechatronics: Integrated Engineering for Industrial and Societal Development, ICOM 11 (2011) 2. Crdenas, J.J., Garcia, A., Romeral, J.L., Andrade, F.: A genetic algorithm approach to optimization of power peaks in an automated warehouse. IECON Proceedings (Industrial Electronics Conference), (2009) 3. Hausman, W.H., Schwarz, L.B., Graves, S.C.: Optimal storage assignment in automatic warehousing systems. Management Science 22, (1976) 4. Oliveira, J.A.: A genetic algorithm with a quasi-local search for the job shop problem with recirculation. In: Applied Soft Computing Technologies: The Challenge of Complexity, pp Springer, Heidelberg (2006) 5. Oliveira, J.A.: Scheduling the truckload operations in automatic warehouses. European Journal of Operational Research 179, (2007) 6. Ko, M., Tiwari, A., Mehnen, J.: A review of soft computing applications in supply chain management. Applied Soft Computing 10, (2010)
10 10 7. Poon, T.C., Choy, K.L., Cheng, C.K., Lao, S.I., Lam, H.Y.: Effective selection and allocation of material handling equipment for stochastic production material demand problems using genetic algorithm. Expert Systems with Applications 38, (2011) 8. Figueiredo, J., Oliveira, J.A., Dias, L., Pereira, G.: A Genetic Algorithm for the Job Shop on an ASRS Warehouse. Computational Science and Its Applications ICCSA 2012 Lecture Notes in Computer Science Volume 7335, (2012) 9. Zhang, C., Li, P., Guan, Z., Rao, Y.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research 53, (2007) 10. Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms - I. representation. Computers & Industrial Engineering 30, (1996) 11. Park, B.J., Choi, H.R., Kim, H.S.: A hybrid genetic algorithm for the job shop scheduling problems. Computers & Industrial Engineering 45, (2003) 12. Oliveira, J.A., Dias, L., Pereira, G.: Solving the Job Shop Problem with a random keys genetic algorithm with instance parameters. Proceedings of 2nd International Conference on Engineering Optimization (EngOpt 2010), Lisbon - Portugal, (CDRom) (2010) 13. Vaessens, R., Aarts, E., Lenstra, J.K.: Job Shop Scheduling by local search. IN- FORMS Journal on Computing 8, (1996) 14. Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA Journal on Computing 6, (1994) 15. Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Operations Research 8, (1960)
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationSOLVING 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
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationClassification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationA Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem
American Journal of Industrial and Business Management, 2016, 6, 774-789 Published Online June 2016 in SciRes. http://www.scirp.org/journal/ajibm http://dx.doi.org/10.4236/ajibm.2016.66071 A Study of Crossover
More informationAn ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 19 An ant colony optimization for single-machine weighted tardiness
More informationGenetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
More informationAPPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,
More informationA Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
More informationMemory 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
More informationEvaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware
Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware Mahyar Shahsavari, Zaid Al-Ars, Koen Bertels,1, Computer Engineering Group, Software & Computer Technology
More informationScheduling Jobs and Preventive Maintenance Activities on Parallel Machines
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr
More informationSTUDY 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,
More informationThe Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain
International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
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
More informationEffects 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
More informationClustering and scheduling maintenance tasks over time
Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating
More informationA Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks
World Applied Sciences Journal 7 (10): 1324-1330, 2009 ISSN 1818-4952 IDOSI Publications, 2009 A Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks Siamak Baradaran and S.M.T.
More informationThe ACO Encoding. Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson
The ACO Encoding Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson School of Computing and Centre for Reasoning, University of Kent, Canterbury, UK {A.Moraglio, F.E.B.Otero, C.G.Johnson}@kent.ac.uk
More informationAvailable 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
More informationAn Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem
An Efficient Combination of Dispatch Rules for Job-shop Scheduling Problem Tatsunobu Kawai, Yasutaka Fujimoto Department of Electrical and Computer Engineering, Yokohama National University, Yokohama 240-8501
More informationInternational 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
More informationAN 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
More informationNew 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
More informationIndex 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
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
More information4.2 Description of the Event operation Network (EON)
Integrated support system for planning and scheduling... 2003/4/24 page 39 #65 Chapter 4 The EON model 4. Overview The present thesis is focused in the development of a generic scheduling framework applicable
More informationEffect 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
More informationA CP Scheduler for High-Performance Computers
A CP Scheduler for High-Performance Computers Thomas Bridi, Michele Lombardi, Andrea Bartolini, Luca Benini, and Michela Milano {thomas.bridi,michele.lombardi2,a.bartolini,luca.benini,michela.milano}@
More informationModel-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms
Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau
More informationDimensioning an inbound call center using constraint programming
Dimensioning an inbound call center using constraint programming Cyril Canon 1,2, Jean-Charles Billaut 2, and Jean-Louis Bouquard 2 1 Vitalicom, 643 avenue du grain d or, 41350 Vineuil, France ccanon@fr.snt.com
More informationEvolutionary SAT Solver (ESS)
Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 3-5, 2011,
More informationLab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms
Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find
More informationEVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING
Int. J. Appl. Math. Comput. Sci., 24, Vol. 14, No. 1, 91 13 EVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING KHALED MESGHOUNI, SLIM HAMMADI PIERRE BORNE Ecole Centrale de Lille, LAIL - UMR 821 BP 48 961
More informationA 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,,
More informationAn 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,
More informationHYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE
1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction
More informationIntegration 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
More informationA 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
More informationNew 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
More informationProduction Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
American J. of Engineering and Applied Sciences 3 (1): 7-14, 2010 ISSN 1941-7020 2010 Science Publications Production Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
More informationA GENETIC ALGORITHM FOR THE RESOURCE CONSTRAINED MULTI-PROJECT SCHEDULING PROBLEM
A GENETIC ALGORITHM FOR THE RESOURCE CONSTRAINED MULTI-PROJECT SCHEDULING PROBLEM J. F. GONÇALVES, J. J. M. MENDES, AND M.G.C. RESENDE ABSTRACT. This paper presents a genetic algorithm (GA) for the Resource
More informationBeam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling
Available online at www.sciencedirect.com Computers & Operations Research ( ) www.elsevier.com/locate/dsw Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling
More informationA 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
More informationA 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
More informationDuplicating 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
More informationAlternative Job-Shop Scheduling For Proton Therapy
Alternative Job-Shop Scheduling For Proton Therapy Cyrille Dejemeppe ICTEAM, Université Catholique de Louvain (UCLouvain), Belgium, cyrille.dejemeppe@uclouvain.be Director: Yves Deville (ICTEAM, UCLouvain)
More informationHybrid Cooperative Coevolution for Fuzzy Flexible Job Shop Scheduling Problems
Hybrid Cooperative Coevolution for Fuzzy Flexible Job Shop Scheduling Problems Juan José Palacios, Camino R. Vela, Jorge Puente Dep. Computer Science University of Oviedo (Spain) {palaciosjuan,crvela,puente}@uniovi.es
More informationResearch 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
More informationAlpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
More informationEA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks
2 EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks Dac-Nhuong Le, Hanoi University of Science, Vietnam National University, Vietnam Optimizing location of controllers
More informationA 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
More informationHighway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation
Wang, Cheu and Fwa 1 Word Count: 6955 Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation Ying Wang Research Scholar Department of Civil Engineering National University
More informationEXAMINATION 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 informationIntroduction to Scheduling Theory
Introduction to Scheduling Theory Arnaud Legrand Laboratoire Informatique et Distribution IMAG CNRS, France arnaud.legrand@imag.fr November 8, 2004 1/ 26 Outline 1 Task graphs from outer space 2 Scheduling
More informationThe Problem of Scheduling Technicians and Interventions in a Telecommunications Company
The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational
More informationManagement 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
More informationA Computer Application for Scheduling in MS Project
Comput. Sci. Appl. Volume 1, Number 5, 2014, pp. 309-318 Received: July 18, 2014; Published: November 25, 2014 Computer Science and Applications www.ethanpublishing.com Anabela Tereso, André Guedes and
More informationEvolutionary Detection of Rules for Text Categorization. Application to Spam Filtering
Advances in Intelligent Systems and Technologies Proceedings ECIT2004 - Third European Conference on Intelligent Systems and Technologies Iasi, Romania, July 21-23, 2004 Evolutionary Detection of Rules
More informationPlanning and Scheduling in the Digital Factory
Institute for Computer Science and Control Hungarian Academy of Sciences Berlin, May 7, 2014 1 Why "digital"? 2 Some Planning and Scheduling problems 3 Planning for "one-of-a-kind" products 4 Scheduling
More informationMIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 132 139 MIP-Based Approaches for Solving
More informationResearch on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province
Research on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province Ran Cao 1,1, Yushu Yang 1, Wei Guo 1, 1 Engineering college of Northeast Agricultural University, Haerbin, China
More informationOn The Multi-Mode, Multi-Skill Resource Constrained Project Scheduling Problem A Software Application
On The Multi-Mode, Multi-Skill Resource Constrained Project Scheduling Problem A Software Application Mónica A. Santos 1, Anabela P. Tereso 2 Abstract We consider an extension of the Resource-Constrained
More informationArithmetic Coding: Introduction
Data Compression Arithmetic coding Arithmetic Coding: Introduction Allows using fractional parts of bits!! Used in PPM, JPEG/MPEG (as option), Bzip More time costly than Huffman, but integer implementation
More informationComparison of algorithms for automated university scheduling
Comparison of algorithms for automated university scheduling Hugo Sandelius Simon Forssell Degree Project in Computer Science, DD143X Supervisor: Pawel Herman Examiner: Örjan Ekeberg CSC, KTH April 29,
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationFinding Liveness Errors with ACO
Hong Kong, June 1-6, 2008 1 / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Motivation Motivation Nowadays software is very complex An error in a software system can imply the
More informationOn heijunka design of assembly load balancing problem: Genetic algorithm & ameliorative procedure-combined approach
International Journal of Intelligent Information Systems 2015; 4(2-1): 49-58 Published online February 10, 2015 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.s.2015040201.17 ISSN:
More informationIntroduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
More informationSoftware Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms
Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms S.MASROM 1, A.M. NASIR 2 Malaysia Institute of Transport (MITRANS) Faculty of Computer and Mathematical Science Universiti
More informationComparison 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
More informationA 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.
More informationA 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
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
More informationLecture. Simulation and optimization
Course Simulation Lecture Simulation and optimization 1 4/3/2015 Simulation and optimization Platform busses at Schiphol Optimization: Find a feasible assignment of bus trips to bus shifts (driver and
More informationHeuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations
Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations AlCoB 2014 First International Conference on Algorithms for Computational Biology Thiago da Silva Arruda Institute
More informationPopulation-based Metaheuristics for Tasks Scheduling in Heterogeneous Distributed Systems
Population-based Metaheuristics for Tasks Scheduling in Heterogeneous Distributed Systems Flavia Zamfirache, Marc Frîncu, Daniela Zaharie Department of Computer Science, West University of Timişoara, Romania
More informationAn Integer Programming Model for the School Timetabling Problem
An Integer Programming Model for the School Timetabling Problem Geraldo Ribeiro Filho UNISUZ/IPTI Av. São Luiz, 86 cj 192 01046-000 - República - São Paulo SP Brazil Luiz Antonio Nogueira Lorena LAC/INPE
More informationA SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES
A SIMULATION STUDY FOR DYNAMIC FLEXIBLE JOB SHOP SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES by Zakaria Yahia Abdelrasol Abdelgawad A Thesis Submitted to the Faculty of Engineering at Cairo University
More informationTwo 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
More informationCLOUD 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,
More informationA genetic algorithm for resource allocation in construction projects
Creative Construction Conference 2015 A genetic algorithm for resource allocation in construction projects Sofia Kaiafa, Athanasios P. Chassiakos* Sofia Kaiafa, Dept. of Civil Engineering, University of
More informationResource Allocation in a Client/Server System for Massive Multi-Player Online Games
IEEE TRANSACTIONS ON COMPUTERS, VOL. 63, NO. 12, DECEMBER 2014 3127 Resource Allocation in a Client/Server System for Massive Multi-Player Online Games Luis Diego Briceño, Howard Jay Siegel, Fellow, IEEE,
More informationMultiobjective Multicast Routing Algorithm
Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9 - National University of Asunción Asunción Paraguay. Tel/Fax: (+9-) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py
More informationKeywords: Beta distribution, Genetic algorithm, Normal distribution, Uniform distribution, Yield management.
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Simulating
More informationAbstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling
Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute
More informationAn 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
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION Power systems form the largest man made complex system. It basically consists of generating sources, transmission network and distribution centers. Secure and economic operation
More informationNAIS: A Calibrated Immune Inspired Algorithm to solve Binary Constraint Satisfaction Problems
NAIS: A Calibrated Immune Inspired Algorithm to solve Binary Constraint Satisfaction Problems Marcos Zuñiga 1, María-Cristina Riff 2 and Elizabeth Montero 2 1 Projet ORION, INRIA Sophia-Antipolis Nice,
More informationEvaluation of Crossover Operator Performance in Genetic Algorithms With Binary Representation
Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation Stjepan Picek, Marin Golub, and Domagoj Jakobovic Faculty of Electrical Engineering and Computing, Unska 3,
More informationInvestigating Parallel Genetic Algorithms on Job Shop Scheduling Problems
Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems Shyh-Chang Lin Erik D. Goodman William F. Punch, III Genetic Algorithms Research and Applications Group Michigan State University
More informationANT COLONY OPTIMIZATION ALGORITHM FOR RESOURCE LEVELING PROBLEM OF CONSTRUCTION PROJECT
ANT COLONY OPTIMIZATION ALGORITHM FOR RESOURCE LEVELING PROBLEM OF CONSTRUCTION PROJECT Ying XIONG 1, Ya Ping KUANG 2 1. School of Economics and Management, Being Jiaotong Univ., Being, China. 2. College
More informationUnit Load Storage Policies
Unit Load Storage Policies Marc Goetschalckx marc.goetschalckx@isye.gatech.edu PASI 2013, Santiago, Chile 1 Instructor Information Born in Belgium Georgia Tech Total research career in logistics, material
More informationStudent Project Allocation Using Integer Programming
IEEE TRANSACTIONS ON EDUCATION, VOL. 46, NO. 3, AUGUST 2003 359 Student Project Allocation Using Integer Programming A. A. Anwar and A. S. Bahaj, Member, IEEE Abstract The allocation of projects to students
More informationDuration Oriented Resource Allocation Strategy on Multiple Resources Projects under Stochastic Conditions
International Conference on Industrial Engineering and Systems Management IESM 2009 May 13-15 MONTRÉAL - CANADA Duration Oriented Resource Allocation Strategy on Multiple Resources Projects under Stochastic
More informationModified Version of Roulette Selection for Evolution Algorithms - the Fan Selection
Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75-453 Koszalin,
More informationUsing Business Intelligence to Mitigate Graduation Delay Issues
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
More informationEvaluating Online Scheduling Techniques in Uncertain Environments
Evaluating Online Scheduling Techniques in Uncertain Environments Michael Thomas, Helena Szczerbicka FG Simulation & Modellierung, Leibniz Universität Hannover, Welfengarten 1, 30167 Hannover, Germany
More information