On the n-job, m-machine permutation flow shop scheduling problems with makespan criterion and rework
Sign Up to like & getrecommendations! Published in 2017 at "Scientia Iranica"
DOI: 10.24200/sci.2017.4443
Abstract: This paper addresses an n-job, m-machine permutation flow shop scheduling problem (PFSSP) with unlimited intermediate buffers and rework activities. The concept of rework means that processing of a job on a machine may not meet… read more here.
Keywords: machine permutation; flow shop; permutation flow; job machine ... See more keywords