We study the problem of scheduling jobs with release times and due-dates on a single machine with the objective to minimize the maximal job lateness. This problem is strongly NP-hard, however it is known to be polynomially solvable for the case when the processing times of some jobs are restricted to either p or 2p, for some integer p. We present a polynomial-time algorithm when job processing ...

Managers often release earnings forecasts in advance of actual earnings announcements. It would appear that managers should at best be indifferent to such release given that the actual earnings will be disclosed at a future date. However, if the manager’s objective is to maximize his firm’s market value and he has control of production decisions, he may be motivated to release an earnings forec...

As part of incremental and iterative software development, decisions about “Is the software product ready to be released at some given release date?” have to be made at the end of each release, sprint or iteration. While this decision is critically important, so far it is largely done either informally or in a simplistic manner, relying on a small set of isolated metrics. In this paper, we pres...

We study a single-machine scheduling problem that is a generalization of a number of problems for which computational procedures have already been published. Each job has a processing time, a release date, a due date, a deadline and a weight representing the penalty per unit-time delay beyond the due date. The goal is to schedule all jobs such that the total weighted tardiness penalty is minimi...

The window between a film’s theatrical and video releases has been steadily declining with some studios now testing day-and-date strategies (i.e., when a film is released across multiple channels at once). We present a model of consumer choice that examines trade-offs between substitutable products (theatrical and video forms), the possibility of purchasing both alternatives, and the timing of ...

The Multi Trip Vehicle Routing Problem with Time Windows and Release Dates is a variant of the Multi Trip Vehicle Routing Problem where a time windows is associated with each customer and a release date is associated with each merchandise to be delivered at a certain client. The release date represents the moment the merchandise becomes available at the depot for final delivery. The problem is ...

The single machine scheduling problem with two types of controllable parameters, job processing times and release dates, is studied. It is assumed that the cost of compressing processing times and release dates from their initial values is a linear function of the compression amounts. The objective is to minimize the sum of the total completion time of the jobs and the total compression cost. F...

This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion time. For this NP-hard problem, the largest sum of release date, processing time and delivery time first rule is designed to determine a certain machine for each job, and the largest difference between delivery time and release date first rule is ...

This study aimed to quantify the changes in grain yield and main agronomic traits winter wheat cultivars registered during past 90 years . A field trial with 18 from 1930 2016 was conducted at experimental Rimiski šančevi two growing seasons The following were measured: yield, stem height, spike length, heading date, hectolitre mass, 1000 weight, number per unit area results of this showed that...

Table of contents 1. Key points 2. Summary 3. Context of life expectancy statistics 4. Geographic analysis of life expectancy statistics 5. National life expectancy 6. Regional life expectancy 7. Local area life expectancy 8. Animated maps and reference tables 9. Methods 10. References 11. Background notes Next release: To be announced Release date: 19 October 2011 Contact: Olugbenga Olatunde m...