A Scheduling Problem in the Baking Industry
This paper addresses a scheduling problem in an actual industrial environment of a baking industry where production rates have been growing every year and the need for optimized planning becomes increasingly important in order to address all the features presented by the problem. This problem contai...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/964120 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849304419535945728 |
|---|---|
| author | Felipe Augusto Moreira da Silva Antonio Carlos Moretti Anibal Tavares de Azevedo |
| author_facet | Felipe Augusto Moreira da Silva Antonio Carlos Moretti Anibal Tavares de Azevedo |
| author_sort | Felipe Augusto Moreira da Silva |
| collection | DOAJ |
| description | This paper addresses a scheduling problem in an actual industrial environment of a baking industry where production rates have been growing every year and the need for optimized planning becomes increasingly important in order to address all the features presented by the
problem. This problem contains relevant aspects of production, such as parallel production, setup time, batch production, and delivery date. We will also consider several aspects pertaining to transportation, such as the transportation capacity with different vehicles and sales production with several customers. This approach studies an atypical problem compared to those that have already been studied in literature. In order to solve the problem, we suggest two approaches: using the greedy heuristic and the genetic algorithm, which will be compared to small problems with the optimal solution solved as an integer linear programming problem, and we will present results for a real example compared with its upper bounds. The work provides us with a new mathematical formulation of scheduling problem that is not based on traveling salesman problem. It considers delivery date and the profit maximization
and not the makespan minimization. And it also provides an analysis of the algorithms runtime. |
| format | Article |
| id | doaj-art-1322f3dc8f7e4c0bb7b6a7a1c3564911 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-1322f3dc8f7e4c0bb7b6a7a1c35649112025-08-20T03:55:44ZengWileyJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/964120964120A Scheduling Problem in the Baking IndustryFelipe Augusto Moreira da Silva0Antonio Carlos Moretti1Anibal Tavares de Azevedo2Department of Applied Mathematics, Institute of Mathematics, Statistics and Scientific Computing, State University of Campinas, Campinas, SP, BrazilSchool of Applied Sciences, State University of Campinas, Limeira, SP, BrazilSchool of Applied Sciences, State University of Campinas, Limeira, SP, BrazilThis paper addresses a scheduling problem in an actual industrial environment of a baking industry where production rates have been growing every year and the need for optimized planning becomes increasingly important in order to address all the features presented by the problem. This problem contains relevant aspects of production, such as parallel production, setup time, batch production, and delivery date. We will also consider several aspects pertaining to transportation, such as the transportation capacity with different vehicles and sales production with several customers. This approach studies an atypical problem compared to those that have already been studied in literature. In order to solve the problem, we suggest two approaches: using the greedy heuristic and the genetic algorithm, which will be compared to small problems with the optimal solution solved as an integer linear programming problem, and we will present results for a real example compared with its upper bounds. The work provides us with a new mathematical formulation of scheduling problem that is not based on traveling salesman problem. It considers delivery date and the profit maximization and not the makespan minimization. And it also provides an analysis of the algorithms runtime.http://dx.doi.org/10.1155/2014/964120 |
| spellingShingle | Felipe Augusto Moreira da Silva Antonio Carlos Moretti Anibal Tavares de Azevedo A Scheduling Problem in the Baking Industry Journal of Applied Mathematics |
| title | A Scheduling Problem in the Baking Industry |
| title_full | A Scheduling Problem in the Baking Industry |
| title_fullStr | A Scheduling Problem in the Baking Industry |
| title_full_unstemmed | A Scheduling Problem in the Baking Industry |
| title_short | A Scheduling Problem in the Baking Industry |
| title_sort | scheduling problem in the baking industry |
| url | http://dx.doi.org/10.1155/2014/964120 |
| work_keys_str_mv | AT felipeaugustomoreiradasilva aschedulingprobleminthebakingindustry AT antoniocarlosmoretti aschedulingprobleminthebakingindustry AT anibaltavaresdeazevedo aschedulingprobleminthebakingindustry AT felipeaugustomoreiradasilva schedulingprobleminthebakingindustry AT antoniocarlosmoretti schedulingprobleminthebakingindustry AT anibaltavaresdeazevedo schedulingprobleminthebakingindustry |