An invasive weed optimization approach for job shop scheduling problems

Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2017-08, Vol.91 (9-12), p.4233-4241
Main Authors: Mishra, S. K., Bose, P. S. C., Rao, C. S. P.
Format: Article
Language:English
Subjects:
Algorithms
CAE) and Design
Computer-Aided Engineering (CAD
Engineering
Industrial and Production Engineering
Job shop scheduling
Job shops
Mechanical Engineering
Media Management
Optimization
Original Article
Production scheduling
Resource scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Scheduling of jobs and resources on a shop floor is an ever green optimization problem. Job shop scheduling problem (JSSP) is an allocation of ‘n’ jobs on ‘m’ machines so as to complete processing of all jobs in a minimum possible time. The JSSP has been addressed by various direct, indirect methods, programs, and algorithms in the last 40 year of literature. This paper presents a new paradigm of invasive weed optimization which mimics the process of weed colonization and distribution to solve JSSPs. The algorithm had shown encouraging and promising outputs on standard benchmarking problems.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-017-0091-x