Ali Allahverdi

Learn More
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per(More)
The assembly flowshop scheduling problem has been addressed recently in the literature. There are many problems that can be modeled as assembly flowshop scheduling problems including queries scheduling on distributed database systems and computer manufacturing. The problem has been addressed with respect to either makespan or total completion time criterion(More)
This paper addresses the problem of scheduling in a two-machine proportionate flowshop with a maximum lateness objective function, where machines are subject to random breakdowns. It is shown that, under appropriate conditions, the Longest Processing Time policy minimizes the objective function with probability t if only the first machine is subject to(More)