View article

We consider online as well as offline scheduling of ordered flow shops with the makespan as objective. In an online flow shop scheduling problem, jobs are revealed to a decisionmaker one by one going down a list. When a job is revealed to the decision maker, its operations have to be scheduled irrevocably without having any information regarding jobs that will be revealed afterwards. We consider for the online setting the so-called Greedy Algorithm which generates permutation schedules in which the jobs on the machines are at all times processed without any unnecessary delays. We focus on ordered flow shops, in particular proportionate flow shops with different speeds and proportionate flow shops with different setup times. We analyze the competitive ratio of the Greedy Algorithm for such flow shops in the online setting. For several cases, we derive lower bounds on the competitive ratios.