A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model
In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into man...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2016-06-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Subjects: | |
| Online Access: | http://www.growingscience.com/ijiec/Vol7/IJIEC_2015_47.pdf |
| _version_ | 1811286187485167616 |
|---|---|
| author | Daniel Rossit Fernando Tohmé Mariano Frutos Jonathan Bard Diego Broz |
| author_facet | Daniel Rossit Fernando Tohmé Mariano Frutos Jonathan Bard Diego Broz |
| author_sort | Daniel Rossit |
| collection | DOAJ |
| description | In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution. |
| first_indexed | 2024-04-13T02:56:03Z |
| format | Article |
| id | doaj.art-8a7be7be3e934104b44d100e3eaf135a |
| institution | Directory Open Access Journal |
| issn | 1923-2926 1923-2934 |
| language | English |
| last_indexed | 2024-04-13T02:56:03Z |
| publishDate | 2016-06-01 |
| publisher | Growing Science |
| record_format | Article |
| series | International Journal of Industrial Engineering Computations |
| spelling | doaj.art-8a7be7be3e934104b44d100e3eaf135a2022-12-22T03:05:39ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342016-06-017350751610.5267/j.ijiec.2015.11.004A non-permutation flowshop scheduling problem with lot streaming: A Mathematical modelDaniel RossitFernando TohméMariano FrutosJonathan BardDiego BrozIn this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.http://www.growingscience.com/ijiec/Vol7/IJIEC_2015_47.pdfNon-Permutation Flowshop SchedulingLot StreamingMakespan |
| spellingShingle | Daniel Rossit Fernando Tohmé Mariano Frutos Jonathan Bard Diego Broz A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model International Journal of Industrial Engineering Computations Non-Permutation Flowshop Scheduling Lot Streaming Makespan |
| title | A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model |
| title_full | A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model |
| title_fullStr | A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model |
| title_full_unstemmed | A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model |
| title_short | A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model |
| title_sort | non permutation flowshop scheduling problem with lot streaming a mathematical model |
| topic | Non-Permutation Flowshop Scheduling Lot Streaming Makespan |
| url | http://www.growingscience.com/ijiec/Vol7/IJIEC_2015_47.pdf |
| work_keys_str_mv | AT danielrossit anonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT fernandotohme anonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT marianofrutos anonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT jonathanbard anonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT diegobroz anonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT danielrossit nonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT fernandotohme nonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT marianofrutos nonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT jonathanbard nonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel AT diegobroz nonpermutationflowshopschedulingproblemwithlotstreamingamathematicalmodel |