About: Genetic algorithm scheduling is a research topic. Over the lifetime, 3265 publications have been published within this topic receiving 78070 citations.
TL;DR: In this application of artificial intelligence to a real-world problem, the constrained scheduling of employee resourcing for a mall type shop is solved by means of a genetic algorithm.
Abstract: In this application of artificial intelligence to a real-world problem, the constrained scheduling of employee resourcing for a mall type shop is solved by means of a genetic algorithm. Chromosomes encode a one-week schedule and a constraint matrix handles all requirements for the population. The genetic operators are purposely designed to preserve all constraints and the objective function assures an imposed coverage, this is for people on both sections of the mall. The results demonstrate that the genetic algorithm approach can provide acceptable solutions to this type of employee scheduling problem with constrains.
TL;DR: The implementation of some Allen's algebra features to avoid adverse discontinuities and to allow crew/work continuity, together with a resource‐driven and space‐constrained scheduling are among the key features of the proposed approach.
Abstract: For some specific types of construction projects, the classical CPM or PDM scheduling techniques are not the most suitable. Few specific scheduling approaches have been developed to cope with construction projects that are made of either repetitive activities or activities with linear developments. But real‐world construction projects do not consist only of such activities. They are generally made of a mixture of linear and/or repetitive activities and of more conventional activities. To allow this, the linear scheduling problem is reformulated, so classical schedule calculation approaches can be used. The implementation of some Allen's algebra features to avoid adverse discontinuities and to allow crew/work continuity, together with a resource‐driven and space‐constrained scheduling are among the key features of the proposed approach. It is also a spin‐off of off‐the‐field practices used for scheduling real projects in the particle accelerator construction domain; an excerpt from such a construction proj...
TL;DR: This paper integrates multi-project scheduling and linear scheduling concepts and simulated annealing is utilized as a searching engine in the second stage to find the probable optimized solution.
Abstract: This paper integrates multi-project scheduling and linear scheduling concepts. Since the problem is combinatorial, a two-stage heuristic solution-finding procedure is used to model the problem with multiple resource constraints. Simulated annealing is utilized as a searching engine in the second stage to find the probable optimized solution. The first stage is slightly different from the other two-stage solution finding procedures which are proposed till now. A numerical example of a multi-project situation is given and solved as well.
TL;DR: In this article, an intelligent hierarchical control model based on a proposed tool management method was developed to optimize the machine utilization and balance tool magazine capacity of a flexible machining workstation (FMW) in a tool sharing environment.
TL;DR: An immune genetic algorithm is proposed to solve the multi-objective flexible job-shop scheduling problem and can generate excellent individuals based on coding and heuristic rules in the initial population and combine the Pareto-optimality and random to deal with the multiple objectives of the FJSP.
Abstract: In this paper, the multi-objective flexible job-shop scheduling problem (FJSP) is studied and formulated in a mixed integer programming model. Combining the artificial immune mechanism and genetic algorithm, an immune genetic algorithm is proposed to solve the FJSP. It can generate excellent individuals based on coding and heuristic rules in the initial population and combine the Pareto-optimality and random to deal with the multiple objectives of the FJSP. The immune mechanism is applied to increase the chaotic sequence search feature in order to improve the diversity in process of genetic evolution which can generate better solution. Numerical experiments demonstrate the effectiveness and efficiency of the algorithm.