This paper studies the allocation of buffer times in a single machine environment. Buffer times are a common tool to protect the schedule against disruptions such as machine failures. We introduce new classes of robust machine scheduling problems. For an arbitrary scheduling problem 1

We consider the problem of allocating containers to ships in which the size of container is 1 or 2, and each ship has its own capacity and fixed departure time. The fixed departure times implies the completion times of containers belonging to the same ship are identical. As objectives, Lmax,...

We analyse congestion pricing in a road and rail network with heterogeneous users. On the road there is bottleneck congestion. In the train there is crowding congestion. We separately analyse proportional heterogeneity that varies the values of time and schedule delay scalarly in fixed...

Most credit portfolio models exclusively calculate the loss distribution for a portfolio of performing counterparts. Conservative default definitions cause considerable insecurity about the loss for a long time after the default. We present three approaches to account for defaulted counterparts...

Applications of zero-inflated count data models have proliferated in empirical economic research. There is a downside to this development, as zero-inflated Poisson or zero-inflated Negative Binomial Maximum Likelihood estimators are not robust to misspecification. In contrast, simple Poisson...