Heuristic Algorithm for the Parallel Machine Total Weighted Tardiness Scheduling Problem


 Tyrone Adams
 2 years ago
 Views:
Transcription
1 Heuristic Algorithm for the Parallel Machine Total Weighted Tardiness Scheduling Problem Rosiane Rodrigues COPPE  Engenharia de Sistemas e Computação Universidade Federal do Rio de Janeiro Departamento de Ciência da Computação Universidade Federal do Amazonas Artur Pessoa, Eduardo Uchoa {artur, Departamento de Engenharia de Produção Universidade Federal Fluminense Marcus Poggi de Aragão Departamento de Informática Pontifícia Universidade Católica do Rio de Janeiro Abstract This paper presents a heuristic algorithm for the parallel machine weighted tardiness scheduling problem (P w j T j ). The main innovative feature of the algorithm is its representation of a multimachine schedule by a single sequence, greatly simplifying the treatment of that problem. The single sequence is optimized using an iterated local search over generalized pairwise interchange moves, improved with a suitable tie breaking criterion. Extensive tests on instances, with 2 and 4 machines, and with up to 50 jobs, obtained very good results, finding optimal solutions in almost all cases.
2 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Introduction Let J = {1,..., n} be a set of jobs to be processed in a set of parallel identical machines M = {1,..., m} without preemption. Each machine can process at most one job at a time and each job must be processed by a single machine. Each job j has a positive processing time p j, a due date d j, and a positive weight w j. The tardiness of a job j with respect to its due date is defined as T j = max{0, C j d j }, where C j is the job completion time. The scheduling problem considered in this paper consists in sequencing the jobs in the machines in order to minimize n j=1 w jt j. This problem, referred as P w j T j in the 3field notation [10], is strongly NPhard, since even the singlemachine case (referred as 1 w j T j ) has that complexity [12]. On the other hand, the singlemachine problem without weights (1 T j ) is NPhard in the ordinary sense [7], but can solved in pseudopolynomial time [12]. All those problems may play an important role in real applications, such as in the manufacturing industry. We are not aware of other heuristic algorithms specially devised for the P w j T j. Recent works on related problems include Anghinolfi and Paolucci (2007) [2], that proposes a hybrid metaheuristic mixing Tabu Search, Simulated Annealing and Variable Neigborhood Search for the P T j ; and Bilge et al. (2004) [4], that proposes a Tabu Search for the P s ij T j (considering sequence dependent setup times). On the other hand, there is a rich literature on heuristics for the 1 w j T j. The most competitive heuristics for that problem are based on local searches that use both insertion moves (remove a job from the sequence and reinsert it in another position) and swap moves (swap the positions of a pair of jobs in the sequence). Those combined moves are also known as generalized pairwise interchange (GPI) moves [6]. Some 1 w j T j heuristics use the GPI moves in a traditional way, making one move at a time [20]. However, better results are obtained using dynamic programming to explore a large neighborhood that consists in certain sequences of single moves, the socalled dynasearch technique. While the size of the neighborhood is potentially exponential, the dynamic programming may determine such an optimal sequence of moves in polynomial time. This technique was introduced by Potts and Val de Verde [17] in the Traveling Salesman Problem (see the survey by Ahuja et al. [1]). Congram et al. [5] first applied dynasearch to the 1 w j T j, but only considering swaps as single moves. Grosso et al. [11] adapted the dynasearch technique in order to consider all GPI moves. Both papers present dynamic programming procedures with O(n 3 ) time complexity per search. Recently, Ergun and Orlin [9] improved this time complexity to O(n 2 ), by giving a faster dynasearch that combines GPI moves and also twist moves. Our heuristic algorithm for the P w j T j features the representation of a multimachine schedule by a single sequence, that can be improved by a local search using the wellknown GPI moves. Unfortunately, the single sequence representation does not appear to be suitable to dynasearch. This happens because this indirect representation makes the evaluation of moves to be much more costly, even a single insertion move may change the completion times of most jobs in a complex way, so the tardiness costs may have to be recomputed from scratch in O(n log m) time. Evaluating the tardiness costs of many sequences of moves is prohibitively expensive. In order to partially remedy the lack of a dynasearch, we introduce a tie breaking criterion in the GPI search. The idea is that even when the current solution has no GPI neighbor with better tardiness cost, the search is not stopped if there are neighbor solutions improving this criterion. The criterion was devised with the hope of guiding the search into solutions that more likely to be further improved. Several exact methods were proposed for the 1 w j T j, including [8, 19, 22, 21, 3, 14, 15]. The last three works describe techniques that can solve instances with up to 100 jobs consistently. However, the best heuristics typically find the optimal solutions for those instances in much less
3 Relatórios de Pesquisa em Engenharia de Produção V. 8 n time. By the way, those heuristics are often embedded as part of those branchandbound based exact algorithms. A good heuristic solution can reduce the search tree, leading to significant speedups. The only exact algorithm for the P w j T j that we know is proposed in [15]. It can solve most instances with up to 50 jobs. The heuristic presented in this paper was created in order to embedded in that exact algorithm. 2 The Algorithm A scheduling for the P w j T j is defined as a sequence of jobs on each machine, where each job appears in exactly one sequence. It is assumed that a machine is only idle after all jobs in its sequence are processed. Moreover, we say that a scheduling is minimal if no machine is idle before all jobs have started their processing. Of course, there is at least one optimal scheduling that is minimal. The main idea of our heuristic algorithm is to represent a minimal P w j T j scheduling as a single sequence of jobs. Let π = (π 1,..., π n ) be a permutation of the job indices 1,..., n. A minimal scheduling can be obtained from π as follows. Start with an empty schedule S, where all machines are idle at time 0. Then, for i = 1,..., n, schedule the job J πi in the first machine that becomes idle according to S. When ties occur, choose the machine with the smallest index. Denote the obtained schedule and its cost by S π and w(π), respectively. Note that every minimal schedule S can be generated in this way. To see this, construct π so that the sequence of jobs (J π1,..., J πn ) is in a nondecreasing order their starting times according to S. When ties occur, put the jobs scheduled in machines with smaller indices first. It is easy to see that S π = S. Given an initial permutation π of jobs, our algorithm performs a local search over a neighborhood defined by GPI moves. They are defined as either an exchange of two (not necessarily adjacent) jobs in π or the removal of a job from π followed by its insertion in another position. Each local search is performed until no GPI move improves the current solution. During the local search, a move is accepted only when the new solution improves upon the previous one. However, locally optimal solutions often have many neighbor solutions with the same cost. Hence, a premature stop in such local optima may be avoided using a suitable tie breaking criterion. Our criterion is based on the values of the due dates and the reverse position of the job in the sequence. In a formal way, given a sequence π = (π 1,..., π n ), we define b(π) = n d πj (n j + 1). Thus, given two neighbor sequences of jobs π and ρ with the same j=1 cost, if b(ρ) < b(π), then ρ is considered to improve over π. Note that our criterion induces the jobs having earlier due dates to be scheduled before the ones with later due dates. This criterion is motivated by the wellknown Earliest Due Date first (EDD) rule [13, 16], which generates an optimal solution for the 1 w j T j when the optimum value is zero (i.e., when there is a solution without tardy jobs). Algorithm 1 below presents the general steps of our heuristic, where N, r and k are parameters.
4 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Algorithm 1 Single sequence based heuristic for the P w j T j i 1; π a permutation following the EDD rule. While i N If i is a multiple of r, then π a random permutation. Apply GPI moves in π, until no improvement is possible. If w(π) < w(π ), then π π. Apply k randomly chosen 2change moves in π. i i + 1. First, it generates a feasible solution following the EDD rule and store in π. In the first iteration, it generates a random permutation π, where the probabilities are identically distributed among all permutations. Then, GPI moves are applied to π. The search on the GPI neighborhood of the current π is stopped when the first improvement move is found, in this case π is updated and a new search starts. This is done until a search is completed without improvement (considering the tie breaking criterion). If the obtained solution improves upon the best solution found so far, then it is kept as π. Finally, k randomly chosen GPI moves are applied (regardless of whether they generate improvements or not), in an attempt to escape from bad local optimal regions. On every r iterations, a completely random permutation replaces the solution generated in the previous iteration. A complete search on the GPI neighborhood tests O(n 2 ) moves. The evaluation of each move requires the construction of the corresponding scheduling, this takes O(n log m) time. 3 Computational Experiments In all our experiments, we set N = 30mn, r = 5, and k = 3. obtained with a Intel Xeon 2.33 GHz processor. The reported times were 3.1 SingleMachine Even though our algorithm was devised for the P w j T j, we also tested it on 1 w j T j instances in order to benchmark it against other methods from the literature. The experiments were performed on the set of 375 instances of the problem available at the ORLibrary. This set was generated by Potts and Wassenhove [18] and contains 125 instances for each n {40, 50, 100}. In fact, for each such n, they created 5 similar instances (changing the seed) for each of 25 parameter configurations of the random instance generator. Therefore, for each value of n there are 25 groups composed by 5 similar instances. Those parameter configurations have influence on the distribution of the due dates. Processing times and weights are always picked from the discrete uniform distribution on [1,100] and [1,10], respectively. The best known results for those instances were obtained by Grosso et al. [11] using the GPIbased Dynasearch algorithm (GPIDS). In that paper, a comparative analysis was done between this method and an older method called AntColony Optimization (ACO), proposed by Stützle et al. [20], that uses the GPI moves in an ACO framework. Table 1 contains a comparison among our algorithm and the two methods above mentioned. The comparison is done on the time (average and maximum) needed to find the optimal value. The CPU times of
5 Relatórios de Pesquisa em Engenharia de Produção V. 8 n GPIDS were obtained in a HP Kayak 800 MHz workstation, while ACO was run on a Pentium III 450 MHz. Table 1: CPU time to find an optimal solution, GPIDS [11], ACO [20], and our algorithm, on OR Library instances with 40, 50 and 100 jobs (125 instances of each size). Topt,avg Topt,max GPIDS ACO Our method GPIDS ACO Our method GPIDS ACO Our method Although our heuristic (as GPIDS and ACO) eventually obtains the optimal solutions for all ORLibrary instances, our CPU times are significantly higher than those by GPIDS. However, even taking taking the difference of the processors into account, the performance of our heuristic is similar to ACO. This is quite remarkable, because when m = 1 our method reduces to a naive implementation of an iterated GPI local search. The factor that may explain why such a simple method matches the performance of a sophisticated metaheuristic using the same neighborhood is the improvement obtained by the tiebreaking criterion. In fact, without that criterion our method would fail to find the optimal solutions for 2 instances with 100 jobs, even after 3000 iterations and 160 seconds of CPU time. On the instances with 100 jobs, the average quality of the solutions found after each GPI local search iteration is 0.67% above the optimal, without the tiebreaking criteria this number would be 1.26% above the optimal. 3.2 MultiMachines In order to perform experiments on the P w j T j problem, we derived 100 new instances from the previously mentioned 1 w j T j ORLibrary instances. For m {2, 4}, n {40, 50}, we pick the first instance in each group (those with numbers ending with the digit 1 or 6) and divided each due date d j by m (and rounded down the result), processing times p j and weights w j are kept unchanged. For example, from instance wt401, we produced instances wt402m1 and wt404m1 by dividing due dates by 2 and 4, respectively. The exact algorithm presented in [15] solved to optimality 98 out of those 100 instances, so we have a good basis to assess the performance of our heuristic. Tables 2 to 5 present detailed results of our heuristic algorithm. The columns have the following meaning: (1) the instance number; (2) the optimal solution value; (3) the value of the best solution found by the heuristic; (4) the difference between the previous values; (5) the iteration in which the best value was first found; (6) the elapsed CPU time (in seconds) when the best value was first found; (7) the number of iterations where the best value was found; (8) the average value of the solutions obtained in all iterations; (9) the total number of iterations performed (given by the algorithm parameter N); and, (10) the total CPU time (in seconds). Table 2 and Table 3 present detailed results considering 2 machines, for 40 and 50 jobs, respectively. Only for a single instance (wt402m116), the optimal solution (or the best known solution, in case of instance wt502m31) was not found. Table 4 and Table 5 present detailed
6 Relatórios de Pesquisa em Engenharia de Produção V. 8 n results considering 4 machines, for 40 and 50 jobs, respectively. Optimal solutions (or the best known solution, in case of instance wt504m56) were found for all tested instances. We also run all instances with a simpler variant of our method, without the tiebreaking criterion. Table 6 compares statistics on those runs with statistics on the runs using the complete method, with the tiebreaking criterion. For each value of m and n, it shows: (1) the number of instances where the optimal or best known solution value was not found; (2) the average quality of the solutions found after each GPI local search iteration; and (3) the total time to complete all the N iterations. It can be seen that the tiebreaking criterion makes the algorithm significantly more robust, with a modest increase on the time spent per iteration (28% in average).
7 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Table 2: Results on instances with 40 jobs and 2 machines. Inst Opt BestV IterBest TBest(s) #Best AvgV TotIter TotT(s) Avg :
8 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Table 3: Results on instances with 50 jobs and 2 machines. Inst Opt BestV IterBest TBest(s) #Best AvgV TotIter TotT(s) Avg :
9 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Table 4: Results on instances with 40 jobs and 4 machines. Inst Opt BestV IterBest TBest(s) #Best AvgV TotIter TotT(s) Avg :
10 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Table 5: Results on instances with 50 jobs and 4 machines. Inst Opt BestV IterBest TBest(s) #Best AvgV TotIter TotT(s) Avg :
11 Relatórios de Pesquisa em Engenharia de Produção V. 8 n Table 6: Effect of the tiebreaking criterion on the proposed algorithm Without tiebreaking With tiebreaking m n #N onopt AvgQ(%) AvgTotT(s) #N onopt AvgQ(%) AvgTotT(s) References [1] R. Ahuja, O. Ergun, J. Orlin, and A. Punnen. A survey of verylarge scale neighborhood search techniques. Discrete Applied Mathematics, 123:75 103, [2] D. Anghinolfi and M. Paolucci. Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers and Operations Research, 34: , [3] L. Bigras, M. Gamache, and G. Savard. Timeindexed formulations and the total weighted tardiness problem. INFORMS Journal on Computing, 1: , [4] U. Bilge, F. Kyraç, F. Kurtulan, and M. Pekgun. A tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research, 31: , [5] R. Congram, C. Potts, and S. van de Velde. An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem. INFORMS Journal of Computing, 14:52 67, [6] F. Della Croce. Generalized pairwise interchanges and machine scheduling. European Journal of Operational Research, 83: , [7] J. Du and J. Leung. Minimizing total tardiness on one processor is NPHard. Mathematics of Operations Research, 15(3): , [8] M. Dyer and L. Wolsey. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26: , [9] O. Ergun and J. Orlin. Fast neighborhood search for the single machine total weighted tardiness problem. Operations Research Letters, 34:41 45, [10] R. Graham, E. Lawler, J. Lenstra, and A. RinnooyKan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5: , [11] A. Grosso, F. Della Croce, and R. Tadei. An enhanced dynasearch neighborhood for the singlemachine total weighted tardiness scheduling problem. Operations Research Letters, 32:68 72, [12] E. Lawler. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Research Letters, 1: , [13] J. Leung. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman&Hall and CRS Press, 2004.
12 Relatórios de Pesquisa em Engenharia de Produção V. 8 n [14] Y. Pan and L. Shi. On the equivalence of the maxmin transportation lower bound and the timeindexed lower bound for single machine scheduling problems. Mathematical Programming, 110: , [15] A. Pessoa, E. Uchoa, M. Poggi de Aragão, and R. Rodrigues. Algorithms over arctime indexed formulations for single and parallel machine scheduling problems. Technical Report RPEP Vol.8 no.8, Universidade Federal Fluminense, Engenharia de Produção, Niterói, Brazil, [16] M. Pinedo. Scheduling: theory, algorithms, and systems. PrenticeHall, [17] C. Potts and S. van de Velde. Dynasearch  iterative local improvement by dynamic programming. Part I: the traveling salesman problem. Technical report, University of Twente, [18] C. Potts and L. Wassenhove. A branchandbound algorithm for the total weighted tardiness problem. Operations Research, 32: , [19] J. Sousa and L. Wolsey. A time indexed formulation of nonpreemptive single machine scheduling problems. Mathematical Programming, 54: , [20] T. Stützle, M. Den Besten, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. Technical report, Technical Report IRIDIA/9916, [21] J. Van der Akker, C. Hurkens, and M. Savelsbergh. Timeindexed formulations for machine scheduling problems:column generation. INFORMS Journal on Computing, 12(2): , [22] J. Van der Akker, C. Van Hoesel, and M. Savelsbergh. A polyhedral approach to singlemachine scheduling problems. Mathematical Programming, 85: , 1999.
An ant colony optimization for singlemachine weighted tardiness scheduling with sequencedependent setups
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 2224, 2006 19 An ant colony optimization for singlemachine weighted tardiness
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 informationBranchandPrice Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN BranchandPrice Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationScheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for nonpreemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
More informationAN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS
versão impressa ISSN 01017438 / versão online ISSN 16785142 AN ANALYSIS OF THE IMPORTANCE OF APPROPRIATE TIE BREAKING RULES IN DISPATCH HEURISTICS Jorge M. S. Valente Faculdade de Economia Universidade
More informationClassification  Examples 1 1 r j C max given: n jobs with processing times p 1,..., p n and release dates
Lecture 2 Scheduling 1 Classification  Examples 11 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
More informationAn improved online algorithm for scheduling on two unrestrictive parallel batch processing machines
This is the PrePublished Version. An improved online 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 informationList Scheduling in Order of αpoints on a Single Machine
List Scheduling in Order of αpoints on a Single Machine Martin Skutella Fachbereich Mathematik, Universität Dortmund, D 4422 Dortmund, Germany martin.skutella@unidortmund.de http://www.mathematik.unidortmund.de/
More informationA Linear Programming Based Method for Job Shop Scheduling
A Linear Programming Based Method for Job Shop Scheduling Kerem Bülbül Sabancı University, Manufacturing Systems and Industrial Engineering, OrhanlıTuzla, 34956 Istanbul, Turkey bulbul@sabanciuniv.edu
More informationJUSTINTIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUSTINTIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More informationIterated Local Search. Variable Neighborhood Search
Iterated Local Search Variable Neighborhood Search Thomas Stützle stuetzle@informatik.tudarmstadt.de http://www.intellektik.informatik.tudarmstadt.de/ tom. Darmstadt University of Technology Department
More informationAn Efficient Algorithm for the Dynamic Space Allocation Problem
EngOpt 28  International Conference on Engineering Optimization Rio de Janeiro, Brazil, 15 June 28. Abstract An Efficient Algorithm for the Dynamic Space Allocation Problem Geiza Cristina da Silva Tiago
More informationSingle machine models: Maximum Lateness 12 Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q...
Lecture 4 Scheduling 1 Single machine models: Maximum Lateness 12 Approximation ratio for EDD for problem 1 r j,d j < 0 L max structure of a schedule 0 Q 1100 11 00 11 000 111 0 0 1 1 00 11 00 11 00
More 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 informationResearch Article Batch Scheduling on TwoMachine Flowshop with MachineDependent Setup Times
Hindawi Publishing Corporation Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on TwoMachine Flowshop with MachineDependent
More informationScheduling and (Integer) Linear Programming
Scheduling and (Integer) Linear Programming Christian Artigues LAAS  CNRS & Université de Toulouse, France artigues@laas.fr Master Class CPAIOR 2012  Nantes Christian Artigues Scheduling and (Integer)
More informationA Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem
A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem Campos,V., Corberán, A., Mota, E. Dep. Estadística i Investigació Operativa. Universitat de València. Spain Corresponding author:
More informationMetaHeuristics for Reconstructing Cross Cut Shredded Text Documents
MetaHeuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria www.ads.tuwien.ac.at
More 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 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 01046000  República  São Paulo SP Brazil Luiz Antonio Nogueira Lorena LAC/INPE
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. #approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of three
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 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 information5 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
More informationA comparison of schedules resulting from priority rules and mathematical optimization for a real production cell
A comparison of schedules resulting from priority rules and mathematical optimization for a real production cell Karin Thörnblad 1 and Linea Kjellsdotter Ivert 2 1. Chalmers University of Technology, Dep.
More informationA 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 informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More informationSimultaneous Job Scheduling and Resource Allocation on Parallel Machines
Simultaneous Job Scheduling and Resource Allocation on Parallel Machines ZhiLong Chen* Department of Systems Engineering University of Pennsylvania Philadelphia, PA 191046315 zlchen@seas.upenn.edu February
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 informationThe Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
More informationA Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks
World Applied Sciences Journal 7 (10): 13241330, 2009 ISSN 18184952 IDOSI Publications, 2009 A Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks Siamak Baradaran and S.M.T.
More informationDesign and Analysis of ACO algorithms for edge matching problems
Design and Analysis of ACO algorithms for edge matching problems Carl Martin Dissing Söderlind Kgs. Lyngby 2010 DTU Informatics Department of Informatics and Mathematical Modelling Technical University
More informationCompletion Time Scheduling and the WSRPT Algorithm
Completion Time Scheduling and the WSRPT Algorithm Bo Xiong, Christine Chung Department of Computer Science, Connecticut College, New London, CT {bxiong,cchung}@conncoll.edu Abstract. We consider the online
More informationA hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem
A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem Marc Reimann Marco Laumanns Institute for Operations Research, Swiss Federal Institute of Technology Zurich, Clausiusstrasse 47,
More informationSimultaneous Scheduling of Machines and Material Handling System in an FMS
Simultaneous Scheduling of Machines and Material Handling System in an FMS B. Siva Prasad Reddy* and C.S.P. Rao** *Department of Mech. Engg., KITS, Warangal5 5 (A.P) INDIA. **Department of Mech. Engg.,
More informationPopulationbased Metaheuristics for Tasks Scheduling in Heterogeneous Distributed Systems
Populationbased 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 informationR 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 32011, February 21, 2011 RUTCOR Rutgers
More informationAn Exact Algorithm for Steiner Tree Problem on Graphs
International Journal of Computers, Communications & Control Vol. I (2006), No. 1, pp. 4146 An Exact Algorithm for Steiner Tree Problem on Graphs Milan Stanojević, Mirko Vujošević Abstract: The paper
More informationIntroducción a Calendarización en Sistemas Paralelas, Grids y Nubes
CICESE Research Center Ensenada, Baja California Mexico Introducción a Calendarización en Sistemas Paralelas, Grids y Nubes Dr. Andrei Tchernykh CICESE Centro de Investigación Científica y de Educación
More informationAn ACO/VNS Hybrid Approach for a LargeScale Energy Management Problem
An ACO/VNS Hybrid Approach for a LargeScale Energy Management Problem Challenge ROADEF/EURO 2010 Roman Steiner, Sandro Pirkwieser, Matthias Prandtstetter Vienna University of Technology, Austria Institute
More informationA class of online scheduling algorithms to minimize total completion time
A class of online scheduling algorithms to minimize total completion time X. Lu R.A. Sitters L. Stougie Abstract We consider the problem of scheduling jobs online on a single machine and on identical
More informationNew Benchmark Instances for the Capacitated Vehicle Routing Problem
New Benchmark Instances for the Capacitated Vehicle Routing Problem Eduardo Uchoa* 1, Diego Pecin 2, Artur Pessoa 1, Marcus Poggi 2, Anand Subramanian 3, Thibaut Vidal 2 1 Universidade Federal Fluminense,
More informationTabu Search to Solve the Synchronized and Integrated TwoLevel Lot Sizing and Scheduling Problem
Tabu Search to Solve the Synchronized and Integrated TwoLevel Lot Sizing and Scheduling Problem Claudio Fabiano Motta Toledo Institute of Mathematics and Computer Science  USP Av. Trabalhador sãocarlense,
More informationA Survey of Very LargeScale Neighborhood Search Techniques
A Survey of Very LargeScale Neighborhood Search Techniques Ravindra K. Ahuja Department of Industrial & Systems Engineering University of Florida Gainesville, FL 32611, USA ahuja@ufl.edu Özlem Ergun Operations
More informationSolving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming
Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Alfredo Olivera and Omar Viera Universidad de la República Montevideo, Uruguay ICIL 05, Montevideo, Uruguay, February
More informationParallel CLM starting solutions comparison *
4 th International Conference on Industrial Engineering and Industrial Management XIV Congreso de Ingeniería de Organización Donostia San Sebastián, September 8 th 10 th 2010 Parallel CLM starting solutions
More informationA Mathematical Programming Solution to the Mars Express Memory Dumping Problem
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem Giovanni Righini and Emanuele Tresoldi Dipartimento di Tecnologie dell Informazione Università degli Studi di Milano Via Bramante
More informationFuzzy Stopping Rules for the Strip Packing Problem
Fuzzy Stopping Rules for the Strip Packing Problem Jesús David Beltrán, Jose Eduardo Calderón, Rayco Jorge Cabrera, José A. Moreno Pérez and J. Marcos MorenoVega Departamento de E.I.O. y Computación Escuela
More informationAnt Colony Optimization for ResourceConstrained Project Scheduling
Ant Colony Optimization for ResourceConstrained Project Scheduling Daniel Merkle, Martin Middendorf 2, Hartmut Schmeck 3 Institute for Applied Computer Science and Formal Description Methods University
More informationChapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NPhard problem. What should I do? A. Theory says you're unlikely to find a polytime algorithm. Must sacrifice one
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationResearch Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok
Research Paper Business Analytics Applications for the Vehicle Routing Problem Jelmer Blok Applications for the Vehicle Routing Problem Jelmer Blok Research Paper Vrije Universiteit Amsterdam Faculteit
More informationCONTENTS HeuristicH HeuristicH
CONTENTS 1 Introduction 1 1.1 Motivation for the thesis.................... 2 1.2 Statement of the problem.................... 7 1.3 Thesis objectives........................ 7 1.4 Summary of contributions...................
More informationThe power of points in preemptive single machine scheduling
JOURNAL OF SCHEDULING J. Sched. 22; 5:121 133 (DOI: 1.12/jos.93) The power of points in preemptive single machine scheduling Andreas S. Schulz 1; 2; ; and Martin Skutella 1 Massachusetts Institute of
More informationDimensioning an inbound call center using constraint programming
Dimensioning an inbound call center using constraint programming Cyril Canon 1,2, JeanCharles Billaut 2, and JeanLouis Bouquard 2 1 Vitalicom, 643 avenue du grain d or, 41350 Vineuil, France ccanon@fr.snt.com
More informationA Study of Local Optima in the Biobjective Travelling Salesman Problem
A Study of Local Optima in the Biobjective Travelling Salesman Problem Luis Paquete, Marco Chiarandini and Thomas Stützle FG Intellektik, Technische Universität Darmstadt, Alexanderstr. 10, Darmstadt,
More informationA binary search algorithm for a special case of minimizing the lateness on a single machine
Issue 3, Volume 3, 2009 45 A binary search algorithm for a special case of minimizing the lateness on a single machine Nodari Vakhania Abstract We study the problem of scheduling jobs with release times
More informationLiterature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
Intelligent Information Management, 2010, 2, 457474 doi:10.4236/iim.2010.28056 Published Online August 2010 (http://www.scirp.org/journal/iim) Literature Review of Single Machine Scheduling Problem with
More informationHeuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time, Part I: Constructive Algorithms
Heuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time, Part I: Constructive Algorithms Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner OttovonGuerickeUniversität,
More informationSingle machine parallel batch scheduling with unbounded capacity
Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University
More informationGREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES MAURICIO G.C. RESENDE AND CELSO C. RIBEIRO Abstract. GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically
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, 774789 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 informationThe vehicle routing problem with time windows is a hard combinatorial optimization problem that has
TRANSPORTATION SCIENCE Vol. 38, No. 4, November 2004, pp. 515 530 issn 00411655 eissn 15265447 04 3804 0515 informs doi 10.1287/trsc.1030.0049 2004 INFORMS A TwoStage Hybrid Local Search for the Vehicle
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More informationThe MultiItem Capacitated LotSizing Problem With Safety Stocks In ClosedLoop Supply Chain
International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 23204052; EISSN 23204060 The MultiItem Capacated LotSizing Problem Wh Safety Stocks In ClosedLoop
More informationSINGLESTAGE MULTIPRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION
SIGLESTAGE MULTIPRODUCT PRODUCTIO AD IVETORY SYSTEMS: A ITERATIVE ALGORITHM BASED O DYAMIC SCHEDULIG AD FIXED PITCH PRODUCTIO Euclydes da Cunha eto ational Institute of Technology Rio de Janeiro, RJ
More informationA 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: 13119702; Online ISSN: 13144081 DOI: 10.1515/cait20150025 A Survey of Solving Approaches
More informationScheduling Breaks in Shift Plans for Call Centers
Scheduling Breaks in Shift Plans for Call Centers Andreas Beer Johannes Gärtner Nysret Musliu Werner Schafhauser Wolfgang Slany Abstract In this paper we consider a reallife break scheduling problem for
More informationThe Hybrid Flow Shop Scheduling Problem
The Hybrid Flow Shop Scheduling Problem Rubén Ruiz 1, José Antonio VázquezRodríguez 2, 1 Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universidad Politécnica de Valencia,
More informationBeamACO 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 BeamACO hybridizing ant colony optimization with beam search: an application to open shop scheduling
More informationScheduling a sequence of tasks with general completion costs
Scheduling a sequence of tasks with general completion costs Francis Sourd CNRSLIP6 4, place Jussieu 75252 Paris Cedex 05, France Francis.Sourd@lip6.fr Abstract Scheduling a sequence of tasks in the acceptation
More informationParallel Simulated Annealing Algorithm for Graph Coloring Problem
Parallel Simulated Annealing Algorithm for Graph Coloring Problem Szymon Łukasik 1, Zbigniew Kokosiński 2, and Grzegorz Świętoń 2 1 Systems Research Institute, Polish Academy of Sciences, ul. Newelska
More informationFAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM
FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM DIOGO V. ANDRADE, MAURICIO G.C. RESENDE, AND RENATO F. WERNECK Abstract. Given a graph G = (V, E), the independent set problem is that of finding
More informationLOAD BALANCING TECHNIQUES
LOAD BALANCING TECHNIQUES Two imporatnt characteristics of distributed systems are resource multiplicity and system transparency. In a distributed system we have a number of resources interconnected by
More informationScheduling. from CPUs to Clusters to Grids. MCSN N. Tonellotto Complements of Distributed Enabling Platforms
Scheduling from CPUs to Clusters to Grids 1 Outline Terminology CPU Scheduling Realtime Scheduling Cluster Scheduling Grid Scheduling Cloud Scheduling 2 General Scheduling refers to allocate limited resources
More informationScheduling the Brazilian soccer tournament with fairness and broadcast objectives
Scheduling the Brazilian soccer tournament with fairness and broadcast objectives Celso C. Ribeiro 1 and Sebastián Urrutia 2 1 Department of Computer Science, Universidade Federal Fluminense, Rua Passo
More informationA MultiObjective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A MultiObjective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
More informationAn Optimization Approach for Cooperative Communication in Ad Hoc Networks
An Optimization Approach for Cooperative Communication in Ad Hoc Networks Carlos A.S. Oliveira and Panos M. Pardalos University of Florida Abstract. Mobile ad hoc networks (MANETs) are a useful organizational
More informationOn the Empirical Evaluation of Las Vegas Algorithms Position Paper
On the Empirical Evaluation of Las Vegas Algorithms Position Paper Holger Hoos ½ Computer Science Department University of British Columbia Email: hoos@cs.ubc.ca Thomas Stützle IRIDIA Université Libre
More informationFactors to Describe Job Shop Scheduling Problem
Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus
More informationInternational Journal of Industrial Engineering Computations
International Journal of Industrial Engineering Computations 7 (2016)*** *** Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/ijiec
More informationIterated Local Search for the Workload Balancing Problem in Service Enterprises
Iterated Local Search for the Workload Balancing Problem in Service Enterprises ThanhHa Nguyen, Mike Wright Lancaster University Management School, Lancaster, LA1 4YX, UK Abstract In this paper, we consider
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 "oneofakind" products 4 Scheduling
More informationScheduling Problem of JobShop with Blocking: A Taboo Search Approach
MIC 20014th Metaheuristics International Conference 643 Scheduling Problem of JobShop with Blocking: A Taboo Search Approach Yazid Mati Nidhal Rezg Xiaolan Xie INRIA/MACSI Project & LGIPM ENIMILE DU
More informationWhy? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
More informationLoad Balancing. Load Balancing 1 / 24
Load Balancing Backtracking, branch & bound and alphabeta pruning: how to assign work to idle processes without much communication? Additionally for alphabeta pruning: implementing the youngbrotherswait
More informationInteger Programming: Algorithms  3
Week 9 Integer Programming: Algorithms  3 OPR 992 Applied Mathematical Programming OPR 992  Applied Mathematical Programming  p. 1/12 DantzigWolfe Reformulation Example Strength of the Linear Programming
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationAn ACObased Approach for Scheduling Task Graphs with Communication Costs
An ACObased Approach for Scheduling Task Graphs with Communication Costs Markus Bank Udo Hönig Wolfram Schiffmann FernUniversität Hagen Lehrgebiet Rechnerarchitektur 58084 Hagen, Germany {Markus.Bank,
More informationA novel ACO technique for Fast and Near Optimal Solutions for the Multidimensional Multichoice Knapsack Problem
A novel ACO technique for Fast and Near Optimal Solutions for the Multidimensional Multichoice Knapsack Problem Shahrear Iqbal, Md. Faizul Bari, Dr. M. Sohel Rahman AlEDA Group Department of Computer
More informationIterated Local Search for the Generator Maintenance Scheduling Problem
MISTA 25 Iterated Local Search for the Generator Maintenance Scheduling Problem Ahmad Almakhlafi Joshua Knowles Abstract We consider the task of devising an effective metaheuristic for a variant of the
More informationAnt Colony Optimization (ACO)
Ant Colony Optimization (ACO) Exploits foraging behavior of ants Path optimization Problems mapping onto foraging are ACOlike TSP, ATSP QAP Travelling Salesman Problem (TSP) Why? Hard, shortest path problem
More information(Refer Slide Time: 01:35)
Artificial Intelligence Prof. Sudeshna Sarkar Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture  6 Informed Search 2 Today we start our 6 th lecture. This
More informationFifty Years of Vehicle Routing
Fifty Years of Vehicle Routing by Gilbert Laporte Canada Research Chair in Distribution Management HEC Montréal Vehicle Routing Problem Depot m (or at most m) identical vehicles based at the depot n customers
More informationA Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 10
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 informationMIPBased 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 MIPBased Approaches for Solving
More informationComputer based Scheduling Tool for Multiproduct Scheduling Problems
Computer based Scheduling Tool for Multiproduct Scheduling Problems Computer based Scheduling Tool for Multiproduct Scheduling Problems Adirake Chainual, Tawatchai Lutuksin and Pupong Pongcharoen Department
More informationINTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET)
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), ISSN 0976 6367(Print) ISSN 0976 6375(Online)
More informationAn Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem
J Heuristics manuscript No. (will be inserted by the editor) An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem Puca Huachi Vaz Penna Anand Subramanian Luiz Satoru Ochi
More information