Shapley value for parallel machine sequencing situation without initial order

DOI10.1155/2015/437403MaRDI QIDQ1665679zbMATH OpenOpenAlexWikidataFDO

Authors Shanshan Liu, Zhaohui Liu

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/437403

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Cooperative games (91A12)

Review text

Summary: We consider the parallel identical machine sequencing situation without initial schedule. For the situation with identical job processing time, we design a cost allocation rule which gives the Shapley value of the related sequencing game in polynomial time. For the game with identical job weight, we also present a polynomial time procedure to compute the Shapley value.

Recommendations

• On a new class of parallel sequencing situations and related games
• scientific article; zbMATH DE number 1248150
• Batch sequencing and cooperation
• Sequencing and Cooperation
• Sequencing games with repeated players

Cites work

• Balancedness of multiple machine sequencing games revisited
• Cooperation in one machine scheduling
• Cost sharing in a job scheduling problem
• Family sequencing and cooperation
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• On games corresponding to sequencing situations with ready times
• On the balancedness of multiple machine sequencing games
• On the balancedness of relaxed sequencing games
• On the convexity of games corresponding to sequencing situations with due dates.
• On the convexity of precedence sequencing games
• Relaxed sequencing games have a nonempty core
• Scheduling independent tasks to reduce mean finishing time
• Sequencing and Cooperation
• Sequencing games
• Sequencing games without initial order
• The split core for sequencing games
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

This page was built for publication: Shapley value for parallel machine sequencing situation without initial order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665679)