The Value of Time Spent for Sequencing of Jobs in Random Sized Batches
We investigate the impact of sequencing jobs arriving in random-sized batches where the
time cost of sequencing is a function of the size of batches. To this end we consider a system with infinite servers receiving arrivals following a Poisson process with random sized batches. Here each batch receives a dedicated service. Each job in a batch has an independent and identically distributed service time distributed arbitrarily. In this setting we measure the performance of stationary decisions based on the batch sizes with respect to flow times.
Aybek Korugan has graduated from ITU with a BSc. in Industrial Engineering in 1992. He received his MS and Ph.D. degrees in 1997 and 2002 at the Laboratory for Responsible Manufacturing of Northeastern University. He worked as a postdoctoral researcher at the Laboratory for Manufacturing and Productivity of MIT until he joined the Faculty of Industrial Engineering at Boğaziçi University. He has taught several courses related to probability modelling. His research interests are applications of queueing systems and networks to traditional and hybrid production environments.