Abstract
A special class of the permutation flow shop problems (PFSPs) with makespan minimization which contains repeated jobs, limited buffer sizes between the machines and fixed number of palettes that carry the jobs on the production line is introduced in this paper. We define the related PB-R-PFSP, the Permutation with Repetition Flow Shop Problem with Palettes and Buffers, and construct new mixed integer linear programming (MILP) models for this problem. The effectiveness of the MILP models and the influence of the number of palettes and buffers on the problems are investigated experimentally.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
