A Discrete Particle Swarm Optimization Algorithm for Job-shop Scheduling Problem to Maximizing Production
نویسندگان
چکیده
This paper researches on a special job-shop scheduling problem meeting capabilities of equipments and different due-dates. Its model is developed, which can accord process capacity and different due-dates in numerous jobs to select some to process, and the objective is as far as possible to maximize output. In order to solve complex scheduling problems proposed in this paper, a discrete particle swarm optimization algorithm is presented to optimize it. To test the performance of the novel algorithm, we use some randomly generated instances to simulate solving the practical problems. Computational experiments show significant improvement over an existing particle swarm optimization algorithm.
منابع مشابه
A Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment
In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملSolving Flexible Job-Shop Scheduling Problem using Hybrid Algorithm Based on Gravitational Search Algorithm and Particle Swarm Optimization
Job Shop scheduling problem has significant importance in many researching fields such as production management and programming and also combined optimizing. Job Shop scheduling problem includes two sub-problems: machine assignment and sequence operation performing. In this paper combination of particle swarm optimization algorithm (PSO) and gravitational search algorithm (GSA) have been presen...
متن کامل