Oğuz, CeydaCorus, Doğan2024-11-092012https://hdl.handle.net/20.500.14288/4864x, 45 l : ill ; 30 cm.restrictedAccessProduction schedulingComputational complexityComputable functionsDominance rules for three-machine flow-shop scheduling problem with unit processing times, release times and chain precedence relationshipsThesis© All Rights Reserved. Accessible to Koç University Affiliated Users Only!