In this paper, we introduce maximum composition ordering problems. The input is n real functions f1, . . . , fn : R → R and a constant c ∈ R. We consider two settings: total and partial compositions. The maximum total composition ordering problem is to compute a permutationThe maximum partial composition ordering problem is to compute a permutation σ :We propose O(n log n) time algorithms for the maximum total and partial composition ordering problems for monotone linear functions fi, which generalize linear deterioration and shortening models for the time-dependent scheduling problem. We also show that the maximum partial composition ordering problem can be solved in polynomial time if fi is of form max{aix+bi, ci} for some constants ai (≥ 0), bi and ci. We finally prove that there exists no constant-factor approximation algorithm for the problems, even if fi's are monotone, piecewise linear functions with at most two pieces, unless P=NP.