Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time

1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang.

Saved in:

Bibliographic Details
Main Authors:	Lee, Lai Soon, Habibeh, Nazif
Other Authors:	lee@math.upm.edu.my
Format:	Working Paper
Language:	English
Published:	Universiti Malaysia Perlis (UniMAP) 2010
Subjects:	Genetic algorithm Single machine scheduling Maximum lateness Completion time Regional Conference on Applied and Engineering Mathematics (RCAEM)
Online Access:	http://dspace.unimap.edu.my/xmlui/handle/123456789/10275
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Universiti Malaysia Perlis
Language:	English

id	my.unimap-10275
record_format	dspace
spelling	my.unimap-102752010-11-24T06:57:44Z Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time Lee, Lai Soon Habibeh, Nazif lee@math.upm.edu.my habibeh@math.upm.edu.my Genetic algorithm Single machine scheduling Maximum lateness Completion time Regional Conference on Applied and Engineering Mathematics (RCAEM) 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang. Single machine family scheduling problem with family setup times is a combinatorial optimisation problems where jobs are partitioned into families and setup time is required between these families. Genetic algorithms using an optimised crossover operator designed by an undirected bipartite graph are proposed for solving the problems of minimising the maximum lateness and minimising the total weighted completion time respectively. Computational experiments are conducted to assess the efficiency of the proposed algorithms compared to other variants of genetic algorithms. Computational results of each problem showed that the proposed algorithms are able to generate better quality solutions compared to others. 2010-11-24T06:57:44Z 2010-11-24T06:57:44Z 2010-06-02 Working Paper Vol.3(6), p.302-307 http://hdl.handle.net/123456789/10275 en Proceedings of the 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 Universiti Malaysia Perlis (UniMAP) Institut Matematik Kejuruteraan
institution	Universiti Malaysia Perlis
building	UniMAP Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Malaysia Perlis
content_source	UniMAP Library Digital Repository
url_provider	http://dspace.unimap.edu.my/
language	English
topic	Genetic algorithm Single machine scheduling Maximum lateness Completion time Regional Conference on Applied and Engineering Mathematics (RCAEM)
spellingShingle	Genetic algorithm Single machine scheduling Maximum lateness Completion time Regional Conference on Applied and Engineering Mathematics (RCAEM) Lee, Lai Soon Habibeh, Nazif Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
description	1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang.
author2	lee@math.upm.edu.my
author_facet	lee@math.upm.edu.my Lee, Lai Soon Habibeh, Nazif
format	Working Paper
author	Lee, Lai Soon Habibeh, Nazif
author_sort	Lee, Lai Soon
title	Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
title_short	Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
title_full	Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
title_fullStr	Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
title_full_unstemmed	Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
title_sort	genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
publisher	Universiti Malaysia Perlis (UniMAP)
publishDate	2010
url	http://dspace.unimap.edu.my/xmlui/handle/123456789/10275
_version_	1643789800002551808

Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time

Similar Items