Family Sequencing and Cooperation

S. Grundel, B.B. Ciftci, P.E.M. Borm, H.J.M. Hamers

Research output: Working paperDiscussion paperOther research output

275 Downloads (Pure)

Abstract

To analyze the allocation problem of the maximal cost savings of the whole group of jobs, we define and analyze a so-called corresponding cooperative family sequencing game which explicitly takes into account the maximal cost savings for any coalition of jobs. Using nonstandard techniques we prove that each family sequencing game has a non-empty core by showing that a particular marginal vector belongs to the core. Finally, we specifically analyze the case in which the initial order is family ordered.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages28
Volume2012-040
Publication statusPublished - 2012

Publication series

NameCentER Discussion Paper
Volume2012-040

Keywords

  • Single-machine scheduling
  • Family scheduling model
  • Setup times
  • Cooperative Game
  • Core
  • Marginal Vector.

Fingerprint Dive into the research topics of 'Family Sequencing and Cooperation'. Together they form a unique fingerprint.

  • Cite this

    Grundel, S., Ciftci, B. B., Borm, P. E. M., & Hamers, H. J. M. (2012). Family Sequencing and Cooperation. (CentER Discussion Paper; Vol. 2012-040). Operations research.