A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems

A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems

The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA, which ca...

Full description

Saved in:
Bibliographic Details
Main Authors: Chia-Shin Chung, James Flynn, Walter Rom, Piotr Staliński
Format: Article
Language:English
Published: Cognitione Foundation for the Dissemination of Knowledge and Science 2012-01-01
Series:Journal of Entrepreneurship, Management and Innovation
Subjects:
genetic algorithm
scheduling
permutation flowshop
tardiness
Online Access: http://jemi.edu.pl/uploadedFiles/file/all-issues/vol8/issue2/JEMI_Vol_8_Issue_2_2012_Article_2.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items