Research Outputs
Permanent URI for this communityhttps://hdl.handle.net/20.500.14288/2
Browse
8 results
Search Results
Publication Restricted A tabu search algorithm for order acceptance and scheduling problem(Koç University, 2010) Cesaret, Bahriye; Oğuz, Ceyda; Salman, Fatma Sibel; 0000-0003-0994-1758; 0000-0001-6833-2552; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 6033; 178838Publication Restricted Dominance rules for three-machine flow-shop scheduling problem with unit processing times, release times and chain precedence relationships(Koç University, 2012) Corus, Doğan; Oğuz, Ceyda; 0000-0003-0994-1758; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 6033
Publication Metadata only On the optimal control of parallel processing networks with resource collaboration and multitasking(INFORMS Institute for Operations Research and the Management Sciences, 2021) N/A; Özkan, Erhun; Faculty Member; School of Medicine; 289255We study scheduling control of parallel processing networks in which some resources need to simultaneously collaborate to perform some activities and some resources multitask. Resource collaboration and multitasking give rise to synchronization constraints in resource scheduling when the resources are not divisible, that is, when the resources cannot be split. The synchronization constraints affect the system performance significant-ly. For example, because of those constraints, the system capacity can be strictly less than the capacity of the bottleneck resource. Furthermore, the resource scheduling decisions are not trivial under those constraints. For example, not all static prioritization policies retain the maximum system capacity, and the ones that retain the maximum system capacity do not necessarily minimize the delay (or, in general, the holding cost). We study optimal scheduling control of a class of parallel networks and propose a dynamic prioritization policy that retains the maximum system capacity and is asymptotically optimal in diffusion scale and a conventional heavy-traffic regime with respect to the expected discounted total holding cost objective.Publication Restricted Order acceptance and scheduling decisions in make-to-order systems(Koç University, 2007) Bilgintürk, Zehra; Salman, Fatma Sibel; Oğuz, Ceyda; 0000-0001-6833-2552; 0000-0003-0994-1758; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 178838; 6033Publication Restricted Pricing and lot sizing decisions in a two-echelon supply chain with transportation costs(Koç University, 2007) Yıldırmaz, Can; Karabatı, Selçuk; Sayın, Serpil; 0000-0001-6976-5405; 0000-0002-3672-0769; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 38819; 6755Publication Restricted Single machine scheduling with timelag constraints(Koç University, 2014) Ermiş, Gülçin; Oğuz, Ceyda; 0000-0003-0994-1758; Koç University Graduate School of Sciences and Engineering; Industrial Engineering and Operations Management; 6033Publication Restricted Variable neighborhood search for flowshop scheduling problem with sequence dependent setup times(Koç University, 2014) Yılmaz, Güneş; Oğuz, Ceyda; 0000-0003-0994-1758; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 6033Publication Restricted Variable neighborhood search for order acceptance and scheduling problem(Koç University, 2013) Altındağ, Ayşegül; Oğuz, Ceyda; 0000-0003-0994-1758; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 6033