Directory UMM :Journals:Journal_of_mathematics:OTHER:
Bebas
44
0
0
Teks penuh
Gambar
Dokumen terkait
Yuan [10] showed that the single machine batch delivery problem to minimize the sum of the total weighted earliness and tardiness and delivery costs of the tardy jobs is NP-complete