Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, m...

Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...

The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...

Scheduling and sequencing is concerned with the optimum allocation of scarce resources over time. Scheduling deals with defining which activities are to be performed at a particular time. Sequencing concerns the ordering in which the activities have to be performed. The allocation of scarce resources over time has been the subject of extensive research since the early days of operations researc...

We introduce the batch sequencing problem (BSP) with item and batch availability for the singlemachine and two-machine ow-shop case. We propose a genetic algorithm which solves the BSP through a decomposition into a Phase I-Batching and a Phase II-Scheduling decision. The batch sequencing problem is closely related to the discrete lotsizing and scheduling problem (DLSP). Computational experienc...

A method is introduced for rapid prototyping and benchmarking of arrival sequencing and scheduling algorithms for air traffic management. The method has three main components: 1) algorithm models 2) recorded air traffic simulation data, and 3) a free software library that interfaces the algorithm models with the simulation output database. By accessing simulation data via a relational database,...