The earliest-deadline-first (EDF) scheduling algorithm, while not optimal for globally-scheduled hard real-time systems, can support any feasible task system with bounded lateness. Furthermore, global-EDF-like (GEL) scheduling algorithms, which prioritize jobs by assigning them fixed priority points based on per-task relative priority points, have been shown to share this same property. Some su...

We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncertain. We use scenario-based stochastic programming with recourse to model the uncertainty in customers and robust optimization for the uncertainty in service times. Our proposed model generates a master plan and daily s...

In the paper the combined routing-scheduling problem which consists in scheduling of tasks on moving executors is considered. The case with non-preemptive and independent tasks, unrelated executors as well as interval processing times to minimize the maximum lateness is investigated. The robust scheduling problem based on the modified relative regret function is formulated. The solution algorit...

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...

I this paper, we consider a class of two-stage stochastic optimization problems arising in the protection of vital arcs in a critical path network. A project is completed after a series of dependent tasks are all finished. We analyze a problem in which task finishing times are uncertain but can be insured a priori to mitigate potential delays. A decision maker must trade off costs incurred in i...

Load-sensitive routing has been integrated into the Internet routing algorithms since the early days of ARPANET. However, drawbacks such as overreaction to changing network conditions and permanent oscillation effects finally caused the idea of load-adaptive routing to be dropped for some decades. In the last years we see once more a tremendous growth of interest in traffic engineering and in l...

Vehicle Routing Problem (VRP) has many applications in real systems, especially distribution and transportation. The optimal determination of vehicle routes impacts increasing economic interests. This research aims to find the solution Pick-up Delivery with Time Windows (VRPPDTW). Targets this problem included reducing distance travel penalties. Three penalties that were considered are a capaci...

Using a sample of male and female workers from the 1992 Employment in Britain survey we estimate a generalised grouped zero-inflated Poisson regression model of employees’ selfreported lateness. Reflecting theoretical predictions from both psychology and economics, lateness is modelled as a function of incentives, the monitoring of and sanctions for lateness within the workplace, job satisfacti...

One of the most important points in a supply chain is customer-driven modeling, which reduces the bullwhip effect in the supply chain, as well as the costs of investment on the inventory and efficient transshipment of the products. Their homogeneity is reflected in the Inventory Routing Problem, which is a combination of distribution and inventory management. This paper expands the classical In...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...