//-->
An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
Alcaide, D., (2002)
Approximate algorithms for theP‖C <Subscript>max</Subscript> problem
Riera, J., (1996)
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
Sedeno-Noda, A., (2006)