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 |