Television commercial scheduling is a generalised form of partition problem, but the lengths involved are rather small, leaving the complexity of the problem unclear. This paper shows that the related problem of colour-restricted spot scheduling is NP-complete, even when the break-lengths are bounded (at most 18 units). We also show that scheduling unit-length spots is easy. The paper is intend...

In this paper we consider the problem of determining the number of structural changes in multiple linear regression models via group fused Lasso (least absolute shrinkage and selection operator). We show that with probability tending to one our method can correctly determine the unknown number of breaks and the estimated break dates are sufficiently close to the true break dates. We obtain esti...

In this chapter we discuss a tactical optimisation problem that arises in a multistage distribution system where customer orders can be delivered from any stockpoint. A simple rule to allocate orders to locations is a break quantity rule, which routes large orders to higher-stage stockpoints and small orders to end-stockpoints. A so-called break quantity determines whether an order is small or ...

This paper presents an algorithm, called JustIn-Case Schedulkg, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prepared for likely errors, just in case they should occur. The Just-In-Case algorithm analyzes a given nominal schedule, determines the most likely break, and reinvokes a scheduler to generate a contingent schedule to cove...

Formulating a quasiclassical approach we determine the cross section for the complete four-body break-up of the lithium ground state following single photon absorption from threshold up to 220 eV excess energy. In addition, we develop a new classification scheme for three-electron ionizing trajectories in terms of electron-electron collisions, thereby identifying two main ionization paths which...