Guaranteed decryption time schedule
Are there known any protocols or algorithms with precisely narrowed time estimate above?


Of course not, because it would depend on the details of the system performing the brute forcing / dictionary attacks. Your comment: "Processor cycle count measurement by brute force breaking scheme" basically contains the answer.


  Is it possible to design such brute force breaking scheme it guarantee that it will be successful after t_min but before t_max?


Same answer of course, but you can certainly create a protocol which requires a certain proof-of-work. And that's precisely what the current block chain technology is all about. But proof-of-work relates to the amount of work performed, not the amount of time that it took.



You could of course also use a trusted third party to release information - such as a key - at a certain time. Not all protocols allow for such a third party to exist though.