[PDF] Top 20 Algorithms for two scheduling problems

... In this paper we are concerned with two particular scheduling miniIr1ization problems invol,;ng unit processing time jobs with release dates and weights and identica[r] ... See full document

... The neighbour functions operators receive a solution and build another from it. This is the most used operator, that allows moving from one solution to another. All local search algorithms use this function ... See full document

... packing problems to a single dimension (Section ...Loading Problems (Section ...these two literatures and study the Container Loading Problem with time Availability Constraints ... See full document

... 19 two close examples in the minority ...TL algorithms to remove noisy examples, from both classes, already present in the data or potentially introduced by ... See full document

... presented two algorithms for solving the grid task scheduling problem through a combination of a genetic algorithm (GA), which is a global search algorithm, and the firefly algorithm (FA), which ... See full document

... presents two loops and is composed by one reservoir (water source) with an elevation of 213 m, one storage reservoir with 253 m of elevation and one pump responsible for pumping the water from the source to all ... See full document

... RCPSP problems considering varied ...project scheduling were taken into consideration (Van de Vonder et ...project scheduling problem were developed in a way that in first version, the activity ... See full document

... a Two-dimensional Bin Packing Problem considering all items, but not considering Unloading Constraints or gathering items of a same customer in the same ... See full document

... skills mastered by the internal resources; the workload capacity. The authors also as- sess the impact that a centralized (single pool of resources) and a de-centralized planning (resources are spanned across several ... See full document

... A tractable strategy can be used to deal in a simple way with projections outside each current target face. An important point in this strategy is the one of normality of the force. Strategies such as the PCE (planned ... See full document

... Both problems involve stationing guards in a (polygonal) environment P so that each point of P is seen by at least one ...no two guards with the same color have overlapping visibility ... See full document

... rostering problems as well as the nurse rostering problem, due to its ...industrial problems involve a type of roster where the sched- uled pattern repeats after a certain time period, thereby resulting in ... See full document

... evaluates two algorithms using the shifted log-logistic utility function: Adaptive Throughput-based Efficiency-Satisfaction Trade-Off (ATES) and Adaptive Satisfaction Control ... See full document

... the two parents, relying on space search technology to complete the search process of the area, the relationship between the searching area and the parent individuals should be linear relation [9] ...between ... See full document

... test problems, Fig 2 shows the numerical performance of the two algo- rithms when the information of NI is considered, and Fig 3 shows the the numerical perfor- mance of the two algorithms ... See full document

... open problems related to ...of two incomplete sequences, similar to what has been done for Scaffold Filling ...parameterized algorithms for LFCS, for example by considering the algebraic technique ... See full document

... Maenhout and Vanhoucke [20] propose a heuristic optimization procedure for the integrated personnel shift and task re-scheduling problem (IPSTrSP). This problem can be divided into two different phases. In ... See full document

... optimisation problems are the subject of study of many practitioners with different scientific backgrounds, like operations research, artificial intelligence and computation ...the problems and the ... See full document

... project scheduling problem with precedence relations, and aims at minimizing two criteria: the makespan and the total weighted start time of the ...metaheuristic algorithms are analyzed, based on ... See full document

... the algorithms on two different computing systems. The CUDA algorithms were executed on a machine with 8 GB of RAM, Operating System Linux (Ubuntu 14:04), (R) Intel Core (TM) processor i5-2430M @ ... See full document