Solving of the economic lot scheduling problem using a power of two based policy
In this project, we propose an algorithm that starts with the Common Cycle time solution which guarantees feasibility to the schedule generated and then improve upon this solution to minimize the cost of production. The power of two based heuristic policy is used to improve the Common Cycle Time sol...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/8394 |
| _version_ | 1811679369876209664 |
|---|---|
| author | Dhivya Chandrasekaran |
| author2 | Viswanathan, S |
| author_facet | Viswanathan, S Dhivya Chandrasekaran |
| author_sort | Dhivya Chandrasekaran |
| collection | NTU |
| description | In this project, we propose an algorithm that starts with the Common Cycle time solution which guarantees feasibility to the schedule generated and then improve upon this solution to minimize the cost of production. The power of two based heuristic policy is used to improve the Common Cycle Time solution. |
| first_indexed | 2024-10-01T03:08:04Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/8394 |
| institution | Nanyang Technological University |
| last_indexed | 2024-10-01T03:08:04Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | ntu-10356/83942023-05-19T03:30:06Z Solving of the economic lot scheduling problem using a power of two based policy Dhivya Chandrasekaran Viswanathan, S Nanyang Business School DRNTU::Business::Operations management::Business planning In this project, we propose an algorithm that starts with the Common Cycle time solution which guarantees feasibility to the schedule generated and then improve upon this solution to minimize the cost of production. The power of two based heuristic policy is used to improve the Common Cycle Time solution. 2008-09-24T07:20:35Z 2008-09-24T07:20:35Z 2002 2002 Final Year Project (FYP) http://hdl.handle.net/10356/8394 Nanyang Technological University application/pdf |
| spellingShingle | DRNTU::Business::Operations management::Business planning Dhivya Chandrasekaran Solving of the economic lot scheduling problem using a power of two based policy |
| title | Solving of the economic lot scheduling problem using a power of two based policy |
| title_full | Solving of the economic lot scheduling problem using a power of two based policy |
| title_fullStr | Solving of the economic lot scheduling problem using a power of two based policy |
| title_full_unstemmed | Solving of the economic lot scheduling problem using a power of two based policy |
| title_short | Solving of the economic lot scheduling problem using a power of two based policy |
| title_sort | solving of the economic lot scheduling problem using a power of two based policy |
| topic | DRNTU::Business::Operations management::Business planning |
| url | http://hdl.handle.net/10356/8394 |
| work_keys_str_mv | AT dhivyachandrasekaran solvingoftheeconomiclotschedulingproblemusingapoweroftwobasedpolicy |