Test:
MyOrderList[list, {b, c, a}]
(*{{{b, 3}, {c, 5}, {a, 1}}, {{b, 1}, {c, 3}, {a, 5}}, {{b, 3},
{c, 1}, {a, 5}}, {{b, 5}, {c, 3}, {a, 1}}}*)
Another approach using the idea of @kglr:
MyOrderList[list_List, order_List] :=
Block[{slist, sorder, ordering, mylist},
slist := Map[Sort, list];
ordering :=
Extract[Map[Ordering@*Ordering, Permutations[order]], {1}];(*@kglr*)
mylist := Table[slist[[i]][[ordering]], {i, 1, Length[slist]}];
Return[mylist];
];
Test:
MyOrderList[list, {c, a, b}]
(*{{{c, 5}, {a, 1}, {b, 3}}, {{c, 3}, {a, 5}, {b, 1}}, {{c, 1},
{a, 5}, {b, 3}}, {{c, 3}, {a, 1}, {b, 5}}}*)