Results 81 to 90 of about 62,265 (211)
GA/SA-based hybrid techniques for the scheduling of generator maintenance in power systems
, 2000 YesProposes the application of a genetic algorithm (GA) and simulated annealing (SA) based hybrid approach for the scheduling of generator maintenance in power systems using an integer representation.
Galloway, S.J. +3 more
core +1 more source
Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug-In Electric Vehicles’ Charging
Energies, 2018 A large-scale integration of plug-in electric vehicles (PEVs) into the power grid system has necessitated the design of online scheduling algorithms to accommodate the after-effects of this new type of load, i.e., PEVs, on the overall efficiency of the ...
Asad Ahmed +4 more
doaj +1 more source
Project scheduling under uncertainty using fuzzy modelling and solving techniques [PDF]
, 2013 In the real world, projects are subject to numerous uncertainties at different levels of planning. Fuzzy project scheduling is one of the approaches that deal with uncertainties in project scheduling problem.
Masmoudi, Malek, Haït, Alain
core +1 more source
Project schedule optimisation utilising genetic algorithms
, 2007 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis extends the body of research into the application of Genetic Algorithms to the Project Scheduling Problem (PSP). A thorough literature review is
Lancaster, John
core
Genetic and memetic algorithms for scheduling railway maintenance activities
Nowadays railway companies are confronted with high infrastructure maintenance costs. Therefore good strategies are needed to carry out these maintenance activities in a most cost effective way.
Dekker, R., Kaymak, U., Budai-Balke, G.
core
Train scheduling with application to the UK rail network
, 2013 Nowadays, transforming the railway industry for better performance and making the best usage of the current capacity are the key issues in many countries.
Khosravi, Banafsheh
core
Better approximation guarantees for job-shop scheduling [PDF]
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S. +3 more
core
Phase transitions in project scheduling. [PDF]
The analysis of the complexity of combinatorial optimization problems has led to the distinction between problems which are solvable in a polynomially bounded amount of time (classified in P) and problems which are not (classified in NP).
De Reyck, B, Herroelen, Willy
core
Machine Scheduling with Resource Dependent Processing Times
We consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling.
Sviridenko,Maxim +2 more
core
A hybrid scatter search. Electromagnetism meta-heuristic for project scheduling. [PDF]
In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the ...
Debels, D +3 more
core