This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing...

We study a class of scheduling problems involving the maximumlateness criterion and an element of batching. For all the problemsthat we examine, algorithms appear in the literature which consistof a sorting step to determine an optimal job sequence, followedby a dynamic programming step which...

In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm...

In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...

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...

This paper proposes an analytical framework for scheduling decisions of road travelers that takes into account probability weighting using rank dependent utility theory. The fundamental difference with the standard scheduling model based on expected utility is that the probabilities of arrivals...

In this paper we study a challenging call center operation problem. The goal of our analysis is to identify an optimal policy for allocating tasks to agents. As a first step, we discuss promising randomized policies and use stochastic approximation for finding the optimal randomized policy when...

This paper analyzes the possibilities to relieve congestion using rewards instead of taxes, as well as combinations of rewards and taxes. The model considers a Vickrey-ADL model of bottleneck congestion with endogenous scheduling. With inelastic demand, a fine (time-varying) reward is equivalent...

We formulate a horizontal differentiation model with price-sensitive demand and asymmetric transport costs, in the context of transport scheduling. Two competitors choose fares and departure times in a fixed time interval. Consumers are distributed uniformly along the interval; their location...

We consider equilibrium and optimum use of a Vickrey road bottleneck, distinguishing between long-run and short-run scheduling preferences in an otherwise stylized scheduling model. The preference structure reflects that there is a distinction between the (exogenous) 'long-run preferred arrival...