Abstract
One machine sequencing situation is introduced and cooperative games theory is used to allocate cost savings when agents cooperate and gain some cost savings. One machine games is proved to be balanced and have a nonempty core. A new cost allocation, the proportion gain allocation approach, is proposed and proved to give a core allocation for one sequencing games. The results in examples show that the proportion gain allocation approach are fair and reasonable for one machine games.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
