ALGORITMA PENJADWALAN JOB SHOP DETERMINISTIK BERBASIS MATRIKS
Because of its complexity, job shop scheduling problem is categorized in NP-hard problem. Jain and Meeran [1999] conducted a comprehensive study that covered job shop scheduling techniques. Jain and Meeran [1999] also showed that research has been shifted towards heuristic techniques, because optimi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/1983 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |