Batch sequencing and cooperation

Abstract

Batch Sequencing and Cooperation Ciftci, B.B.; Borm, P.E.M.; Hamers, H.J.M.; Slikker, M.

On interactive sequencing situations with exponential cost functions

“…We mention Hamers, Borm, and Tijs (1995) by imposing ready times, Borm, Fiestras-Janeiro, Hamers, Sánchez, and Voorneveld (2002) by imposing due dates, Rustogi and Strusevich (2012) by studying positional effects, Lohmann, Borm, and Slikker (2014) by analyzing just-in-time arrivals and Musegaas, Borm, and Quant (2015) by considering step out-step in sequencing games. Moreover, Grundel, Çiftçi, Borm, and Hamers (2013), Gerichhausen and Hamers (2009) and Çiftçi, Borm, Hamers, and Slikker (2013) studied the grouping of players in families or batches. Finally, we mention Klijn and Sánchez (2006), who studied uncertainty sequencing games.…”

Cooperative sequencing games with position-dependent learning effect

“…They also introduced and characterized the equal gain splitting (EGS) rule, which can be interpreted as an algorithmic procedure to compute a core allocation. During the past few decades, different types of variations of sequencing situations and games have been presented in the literature, including ready times [11], due dates [2], multiple machines [3,12,17], grouped jobs [4,10] multistage situations [5,6] and sequencing situations without an initial order [13].…”

Multiple-Machine Scheduling with Learning Effects and Cooperative Games

“…Sequencing games have been extended by many researchers. The extensions focus on the allocation rules [20,21], the number of jobs [22,23], the admissible rearrangements of jobs [24,25], the initial order of jobs [26,27], the family or batch sequencing situations [28,29], the ready times [30], and the due-dates [31]. Convexity and balancedness of the corresponding sequencing games are the main goals of these studies as convex games and balanced games have nice properties.…”