The range of low-cost methods available to the small producer for dispatching small numbers of poultry is limited. None of the commonly used methods is satisfactory as there are doubts that they fully protect the welfare of the bird. There are humane methods available but they involve some initial capital outlay. Probably the most common method is 'neck pulling' (cervical dislocation). If carri...

The synchronized Vehicle Dispatching Problem (SVDP) is a transportation problem that arises in many real world situations. One that illustrates well this problem is special version of the Dial-a-Ride problem, in which some disabled persons require assistance in order to prepare for transportation. In this case, a special team is sent to the residence of the special customer a few minutes before...

Challenged by urbanization and increasing travel needs, existing transportation systems call for new mobility paradigms. In this article, we present the fleet management charging scheduling of a shared mobility-on-demand system, whereby electric vehicle fleets are operated centralized platform to provide customers with service. We comprehensive review system operation based on operational objec...

Emergency Medical Service (EMS) systems are a service that provides acute care and transportation to a place for definitive care, to people experiencing a medical emergency. The ultimate goal of EMS systems is to save lives. The ability of EMS systems to do this effectively is impacted by several resource allocation decisions including location of servers (ambulances), districting of demand zon...

Real-time and embedded systems are systems that react continuously to their environment within time constraints and at a speed imposed by the environment. The success of such systems relies upon their capability of producing functionally correct results within defined timing constraints. In such systems, the role of Worst-Case Execution Time (WCET) analysis is fundamental since the WCET estimat...

We consider the optimal scheduling of a nite capacity shuttle in a two node network with imperfect information. When shuttle trips do not depend on the number of passengers carried, we prove optimality and monotonicity of threshold policies. We derive conditions for dispatching which reduce the computational eeort required to compute an optimal threshold policy. We provide a counterexample to t...