
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
Keywords: 90B35; 90B10; 90C27Pre-emptive open-shop scheduling; Bicriteria optimization; Network flow approach; Time-windows; Max-flow parametrical algorithm