We consider the problem of scheduling trains and containers (or trucks and pallets) between a depot and a destination. Goods arrive at the depot dynamically over time and have distinct due dates at the destination. There is a fixed-charge transportation cost for each vehicle, and each vehicle has the same capacity. The cost of holding goods may differ between the depot and the destination. The ...

Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...

When firms operate in a make-to-order environment, they must set due dates (or lead times) which are both relatively soon in the future and can be met reliably in order to compete effectively. This can be a difficult task, since there is clearly an inherent tradeoff between short due dates, and due dates that can be easily met. Nevertheless, the vast majority of due date scheduling research ass...

FACULTY OF SOCIAL, HUMAN AND MATHEMATICAL SCIENCES Mathematical Sciences Doctor of Philosophy THE VEHICLE ROUTING PROBLEM WITH RELEASE AND DUE DATES: FORMULATIONS, HEURISTICS AND LOWER BOUNDS Benjamin C. Shelbourne A novel extension of the classical vehicle routing and scheduling problem is proposed that integrates aspects of machine scheduling into vehicle routing. Associated to each customer ...

We consider single-machine stochastic scheduling models with due dates as decisions. In addition to showing how to satisfy given service-level requirements, we examine variations of a model in which the tightness of due-dates conflicts with the desire to minimize tardiness. We show that a general form of the trade-off includes the stochastic E/T model and gives rise to a challenging scheduling ...

This paper addresses a project scheduling environment in which the activities are partitioned among set of agents. The owner is interested completing as soon possible. Therefore, she/he defines rewards and penalties to stimulate agents complete faster. offers per-day reward for early completion intermediate milestones be met within specific due dates, with associated penalties. Each agent can, ...

Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the ubject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly iminishes for rather long time horizons. Recently, an MILP continuous problem representation in both time an...

A set of n jobs with statistically independent random processing times has to be processed on a single machine without idling between jobs and without preemption. It is required to set due dates and promise them to customers. During the production stage, earliness and tardiness against the promised due dates will be penalized. The goal is to minimize the total expected penalties.We consider two...

This paper presents a set of satisfiability tests and time-bound adjustments that can be applied to cumulative scheduling problems. We introduce the Cumulative Scheduling Problem (CuSP), an extension of the m-machine problem in which activities, having both release and due dates, can require more than one unit of the resource. Given a CuSP instance, we present two necessary conditions for the e...

In this paper we study the Multi-period Vehicle Routing Problem with Due dates (MVRPD), where customers have to be served between a release and a due date. Customers with due dates exceeding the planning period may be postponed at a cost. A fleet of capacitated vehicles is available to perform the distribution in each day of the planning period. The objective of the problem is to find vehicle r...