13 research outputs found
A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
No full textA genetic approach to the scheduling of preventive maintenance tasks on a single product manufacturing production line
No full textOptimization of Genetic Algorithm Parameters for Multi-channel Manufacturing Systems by Taguchi Method
No full textUse of MCDM and AI Techniques for Mechanization of In-Service Inspection Planning Process
No full textOptimal production and inspection policy while considering minimal repair, preventive maintenance error and inspection time
No full textRobust Basic Cyclic Scheduling Problem
No full textInternational audienceThis paper addresses the Basic Cyclic Scheduling Problem where the processing times are affected by uncertainties. We formulate the problem as a two-stage robust optimization problem with polyhedral uncertainty set. We propose three exact algorithms for solving the problem. Two of them use a negative circuit detection algorithm as a subroutine and the last one is an Howard's algorithm adaptation. Results of numerical experiments on randomly generated instances show that the Howard's algorithm adaptation yields efficient results and opens perspectives on more difficult robust cyclic scheduling problems
A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem
No full text
Orthogonal Taguchi-based cat algorithm for solving task scheduling problem in cloud computing
No full text
