MULTIPLE OBJECTIVE FUNCTION ON A SINGLE MACHINE SCHEDULING
We consider a single machine scheduling problem to minimize a multiple objective function; sum of earliness, tardiness and completion time. As this problem is complete NP-hard we propose a branch and bound algorithm to obtain an optimal solution. The implementation of optimizing algorithms dose see...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Mathematics, University of Kufa
2010-04-01
|
| Series: | Journal of Kufa for Mathematics and Computer |
| Subjects: | |
| Online Access: | https://journal.uokufa.edu.iq/index.php/jkmc/article/view/12761 |