相关论文: Pseudopolynomial algorithm for single machine sche…

The Windows Scheduling Problem, also known as the Pinwheel Problem, is to schedule periodic jobs subject to their processing frequency demands. Instances are given as a set of jobs that have to be processed infinitely often such that the…

We consider the classic scheduling problem of minimizing the total weighted flow-time on a single machine (min-WPFT), when preemption is allowed. In this problem, we are given a set of $n$ jobs, each job having a release time $r_j$, a…

This paper was withdrawn on 20.11.97.

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

This paper has been withdrawn.

This paper has been withdrawn by the author due to a crucial error in the last lines in the proof of Lemma 3.3.

In this paper, the single machine scheduling problem with deteriorating jobs and learning effects are considered, which is shown in the previous research that the SDR method no longer provides an optimal solution for the problem. In order…

This paper has been withdrawn by the author due to some errors.

This paper has been withdrawn by the author due to a crucial error in the proof of Theorem 1.

People are often reluctant to incorporate information produced by algorithms into their decisions, a phenomenon called ``algorithm aversion''. This paper shows how algorithm aversion arises when the choice to follow an algorithm conveys…

The paper has been withdrawn because the research work is still in progress.

Over the last decade, implementations of several desingularization algorithms have appeared in various contexts. These differ as widely in their methods and in their practical efficiency as they differ in the situations in which they may be…

This paper has been withdrawn

In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with…

This paper has been withdrawn by the author due to serious flaws in certain proofs. For instance, the method used to construct certain automorphic representations is flawed.

This paper has been withdrawn because it is a duplicate of [math/0609208].

Withdrawn due to an incompleteness of the main results.

The paper was withdrawn by the authors

The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence…