The neglect of buffering requirements in a classical job shop scheduling system often results in inapplicability in many complex real-world applications. To overcome this inapplicability, a new and more generalised scheduling problem is proposed under different stage-dependent buffering requirements and parallel use of identical-function machine units at each processing stage in job shop environments. The problem is formulated as a mixed integer programming model that can be exactly solved by ILOG-CPEX for small-size instances. Moreover, a hybrid metaheuristic algorithm embedded with a state-of-the-art constructive algorithm is developed. The computational experiment shows that the proposed metaheuristic can efficiently solve large-size instances. The result analysis indicates that the proposed approach can provide better configuration of real-world scheduling systems. The proposed DBPMJSS methodology has a potential to analyse, model and solve many industrial systems with the requirements of buffering conditions, particularly for manufacturing, railway, healthcare and mining industries.