Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm
The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/59479/ http://dx.doi.org/10.1063/1.4915695 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|