Global Bacteria Optimization Meta-Heuristic Algorithm for Jobshop Scheduling

Global Bacteria Optimization Meta-Heuristic Algorithm for Jobshop Scheduling

Jairo R. Montoya-Torres, Libardo S. Gómez-Vizcaíno, Elyn L. Solano-Charris, Carlos D. Paternina-Arboleda
Copyright: © 2010 |Pages: 12
DOI: 10.4018/joris.2010100103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper examines the problem of jobshop scheduling with either makespan minimization or total tardiness minimization, which are both known to be NP-hard. The authors propose the use of a meta-heuristic procedure inspired from bacterial phototaxis. This procedure, called Global Bacteria Optimization (GBO), emulates the reaction of some organisms (bacteria) to light stimulation. Computational experiments are performed using well-known instances from literature. Results show that the algorithm equals and even outperforms previous state-of-the-art procedures in terms of quality of solution and requires very short computational time.
Article Preview
Top

Problem Description And Overview Of Literature

As stated before, scheduling is a decision-making process that is used on a regular basis in many manufacturing and services industries. It deals with the allocation of resources (often simply called machines) to task (jobs) over given time periods and its goal is to optimize one or more objectives (Pinedo, 2008). Efficient production schedules can result in substantial improvements in productivity and cost reductions in manufacturing and service industries. Generating a feasible schedule that best meets management’s objectives is a difficult task that firms face every day (Ozgur & Brown, 1995). Among the various types of scheduling problems, jobshop scheduling is one of the most challenging.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 14: 1 Issue (2023)
Volume 13: 2 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing