One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not allowed, then the demand of a given period cannot be delivered earlier or later than the period. If...

We consider the Capacitated Economic Lot Size Problem with piecewise linear production costs and general holding costs, which is an NP-hard problem but solvable in pseudo-polynomial time. A straightforward dynamic programming approach to this problem results in an O(n ² c\bar d\bar ) algorithm,...

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated in the presence of production capacities and concave cost functions. The model we study generalizes the uncapacitated serial single-item multilevel economic lot-sizing model...

We study a two-echelon supply chain consisting of a supplier and a retailer, where the supplier uses a simple and easily implementable incentive scheme - making a side payment - to influence the retailer's ordering plan. The supplier makes a take-it-or-leave-it offer to the retailer in the form...

One of the main points of criticism on academic research in operations research (management science) is that there is too much emphasis on the mathematical aspects of the discipline. In particular, the mathematical models that lend themselves to rigorous mathematical analysis are often rough...

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the...

In designing coordination contracts, the conflict between theory and practice often appears in the form of a trade-off between the complexity of theoretically optimal solutions and their ease of implementation in the real world. In this study, we explicitly consider complexity as a design factor...

This paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our dynamic...