Distributed databases principles and systems
Distributed databases principles and systems
Job lateness in a two-machine flowshop with setup times separated
Computers and Operations Research
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
Computers and Operations Research
Correctness of query execution strategies in distributed databases
ACM Transactions on Database Systems (TODS)
Fundamentals of Database Systems
Fundamentals of Database Systems
Computers and Operations Research
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Parameter Selection in Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Comparison between Genetic Algorithms and Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Computers and Operations Research
PSO-based algorithm for home care worker scheduling in the UK
Computers and Industrial Engineering
A new particle swarm optimization for the open shop scheduling problem
Computers and Operations Research
A discrete particle swarm optimization algorithm for uncapacitated facility location problem
Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
A distributed PSO-SVM hybrid system with feature selection and parameter optimization
Applied Soft Computing
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
Computers and Operations Research
The two-stage assembly scheduling problem to minimize total completion time with setup times
Computers and Operations Research
A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
Computers and Industrial Engineering
A particle swarm optimization algorithm for flexible jobshop scheduling problem
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Hi-index | 0.01 |
The assembly flowshop scheduling problem has been addressed recently in the literature. There are many problems that can be modeled as assembly flowshop scheduling problems including queries scheduling on distributed database systems and computer manufacturing. The problem has been addressed with respect to either makespan or total completion time criterion in the literature. In this paper, we address the problem with respect to a due date-based performance measure, i.e., maximum lateness. We formulate the problem and obtain a dominance relation. Moreover, we propose three heuristics for the problem: particle swarm optimization (PSO), Tabu search, and EDD. PSO has been used in the areas of function optimization, artificial neural network training, and fuzzy system control in the literature. In this paper, we show how it can be used for scheduling problems. We have conducted extensive computational experiments to compare the three heuristics along with a random solution. The computational analysis indicates that Tabu outperforms the others for the case when the due dates range is relatively wide. It also indicates that the PSO significantly outperforms the others for difficult problems, i.e., tight due dates. Moreover, for difficult problems, the developed dominance relation helps reduce error by 65%.