Particle swarm optimization and discrete artificial bee colony algorithms for solving production scheduling problems release_bzsieh7zvzhkblmct3nnmbdcam

by Tadeusz Witkowski

Published in Technical Sciences by Uniwersytet Warminsko-Mazurski.

2019   Issue 22, p61-74

Abstract

This paper shows the use of Discrete Artificial Bee Colony (DABC) and Particle Swarm Optimization (PSO) algorithm for solving the job shop scheduling problem (JSSP) with the objective of minimizing makespan. The Job Shop Scheduling Problem is one of the most difficult problems, as it is classified as an NP-complete one. Stochastic search techniques such as swarm and evolutionary algorithms are used to find a good solution. Our objective is to evaluate the efficiency of DABC and PSO swarm algorithms on many tests of JSSP problems. DABC and PSO algorithms have been developed for solving real production scheduling problem too. The experiment results indicate that this problem can be effectively solved by PSO and DABC algorithms.
In application/xml+jats format

Archived Files and Locations

application/pdf  906.3 kB
file_7pl436q4jbbjrdvec5mpchzkcm
czasopisma.uwm.edu.pl (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2019-02-07
Container Metadata
Open Access Publication
Not in DOAJ
In ISSN ROAD
Not in Keepers Registry
ISSN-L:  1505-4675
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 1da7aec1-d7f0-4e8a-ad2e-3502d18f2901
API URL: JSON