
A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
Keywords: برنامهریزی; Scheduling; Flowshop; Makespan; Random and bounded processing times; Setup times