A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem
Machines Scheduling Problems are one of the classical combinatorial optimization problems which exist in many diverse areas such as transportation, manufacturing system, etc. The main focus is on the efficient allocation of one or more resources to activities over time. In this paper, we consider a...
Saved in:
Main Authors: | Lee, Lai Soon, Nazif, Habibeh |
---|---|
Format: | Conference or Workshop Item |
Published: |
2009
|
Online Access: | http://psasir.upm.edu.my/id/eprint/8838/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
by: Lee, Lai Soon, et al.
Published: (2010) -
Solving single machine scheduling problem with maximum lateness using a genetic algorithm
by: Nazif, Habibeh, et al.
Published: (2010) -
A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time
by: Nazif, Habibeh, et al.
Published: (2009) -
Optimised crossover genetic algorithm for capacitated vehicle routing problem
by: Nazif, Habibeh, et al.
Published: (2012) -
Optimized crossover genetic algorithm for vehicle routing problem with time windows
by: Nazif, Habibeh, et al.
Published: (2010)