Shapley value for parallel machine sequencing situation without initial order

DOI10.1155/2015/437403zbMath1394.90290OpenAlexW1549487826WikidataQ59118587 ScholiaQ59118587MaRDI QIDQ1665679

Shanshan Liu, Zhaohui Liu

Publication date: 27 August 2018

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

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the convexity of precedence sequencing games
• Sequencing games
• On the balancedness of relaxed sequencing games
• On the balancedness of multiple machine sequencing games
• The split core for sequencing games
• On games corresponding to sequencing situations with ready times
• Family sequencing and cooperation
• Cost sharing in a job scheduling problem
• Sequencing games without initial order
• Balancedness of multiple machine sequencing games revisited
• Cooperation in one machine scheduling
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Sequencing and Cooperation
• Scheduling independent tasks to reduce mean finishing time
• Relaxed sequencing games have a nonempty core
• On the convexity of games corresponding to sequencing situations with due dates.

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