This paper addresses the problem of optimal planning for collection, sorting, and recycling operations. The problem arises in industrial waste management, where distinct actors manage the collection and the sorting operations. In a weekly or monthly plan horizon, they usually interact to find a suitable schedule for servicing customers but with a not well-defined scheme. We proposal an improved negotiation-based approach using an auction mechanism for optimizing these operations. Two interdependent models are presented: one for waste collection by a logistics operator and the other for sorting operations at a recycling plant. These models are formulated as mixed-integer linear programs where costs associated with sorting and collection are to be minimized, respectively. We describe the negotiation-based approach involving an auction where the logistics operator bids for collection time slots, and the recycling plant selects the optimal bid based on the integration of sorting and collection costs. This approach aims to achieve an optimization of the entire waste management process. Computational experiments are presented.