Combinatorial auctions are used as a distributed coordination mechanism in Multiagent Systems. The use of combinatorial auctions as negotiation and coordination mechanism is especially appropriate in systems with interdependencies and complementarities such as manufacturing scheduling systems. In this work we review some updating price mechanisms for combinatorial auctions based on the Lagrangian Relaxation Method. We focus our research to solve the optimization scheduling problem in the shop floor, taking into account the objectives of resource allocation in dynamic environments, i.e. -robustness, stability, adaptability, and efficiency-.