SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING
Nowadays, catering industry is one of profitable industry in Indonesia. Catering industry needs napkins for serving meals to their customers. Used napkins will be washed in laundry service. There are two types of laundry services: faster service with high cost and slower service with low cost. We ne...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/21517 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:21517 |
|---|---|
| spelling |
id-itb.:215172017-11-17T15:06:12ZSOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING FAIZA (10113028), CHUSNA Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/21517 Nowadays, catering industry is one of profitable industry in Indonesia. Catering industry needs napkins for serving meals to their customers. Used napkins will be washed in laundry service. There are two types of laundry services: faster service with high cost and slower service with low cost. We need to minimize total cost in providing clean napkins according to limited resource. In this final project, an algorithm based on dynamic programming is constructed and simulated to solve the scheduling problem, both for single-company and multi-company text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
Nowadays, catering industry is one of profitable industry in Indonesia. Catering industry needs napkins for serving meals to their customers. Used napkins will be washed in laundry service. There are two types of laundry services: faster service with high cost and slower service with low cost. We need to minimize total cost in providing clean napkins according to limited resource. In this final project, an algorithm based on dynamic programming is constructed and simulated to solve the scheduling problem, both for single-company and multi-company |
| format |
Final Project |
| author |
FAIZA (10113028), CHUSNA |
| spellingShingle |
FAIZA (10113028), CHUSNA SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING |
| author_facet |
FAIZA (10113028), CHUSNA |
| author_sort |
FAIZA (10113028), CHUSNA |
| title |
SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING |
| title_short |
SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING |
| title_full |
SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING |
| title_fullStr |
SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING |
| title_full_unstemmed |
SOLVING SCHEDULING PROBLEM FOR PROVIDING CLEAN NAPKINS IN CATERING INDUSTRY BY DYNAMIC PROGRAMMING |
| title_sort |
solving scheduling problem for providing clean napkins in catering industry by dynamic programming |
| url |
https://digilib.itb.ac.id/gdl/view/21517 |
| _version_ |
1822019525934055424 |