The two-machine flowshop total completion time problem: A branch-and-bound based on network-flow formulation

@inproceedings{Detienne2015TheTF,
  title={The two-machine flowshop total completion time problem: A branch-and-bound based on network-flow formulation},
  author={Boris Detienne and Ruslan Sadykov and Shunji Tanaka},
  year={2015}
}
We consider the problem of scheduling a set J = {1, . . . , n} of jobs in a two-machine flowshop with the objective to minimize the sum of the completion times of jobs. The jobs are available at time zero and they should be processed first on machine 1, and then on machine 2. Each machine can process at most one job at a time. Let pj denote the processing time of job j on machine m, where m = 1, 2. All the processing times are integer. Preemption of the processing of the jobs in not allowed on… CONTINUE READING