Abstract
This paper deals with the no-delay permutation flow shop with two machines and two kinds of jobs. In this case, the distribution of the makespan for a randomly chosen sequence can be computed analytically with special numbers N(n, p, i) that are extensions of the binomial numbers. The makespan's distribution is also given analytically when the distribution of jobs among the two types is binomial. These distributions show a great asymmetry that confirms most of experimental observations that are proposed in the literature. These results are obtained by an analogy between this particular scheduling problem and the lattice path counting problem (random walk) studied for more than a century in theoretical combinatory.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
