Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Complexity of machine scheduling problems
Scheduling subject to resource constraints: classification and complexity
Complexity of vehicle routing and scheduling problems
The complexity of a class of vehicle routing and scheduling problems is investigated and known NP-hardness results are reviewed and compiled to compile the worst-case performance of approximation algorithms.
Deterministic Production Planning: Algorithms and Complexity
A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions…
Bounds and Heuristics for Capacitated Routing Problems
Asymptotically optimal bounds and heuristics are developed for a capacitated routing problem that will find a solution with relative error at most (epsilon) in time polynomial in the number of customers.
Complexity of Scheduling under Precedence Constraints
The use of precedence constraints between jobs that have to be respected in every feasible schedule is illustrated by extending some typical NP-completeness results and simplifying their correctness proofs for scheduling problems involving precedence constraints.
Single machine flow-time scheduling with a single breakdown
It is shown that if the distribution function of the time to breakdown is concave then Shortest Processing Time first scheduling stochastically minimizes the flowtime and that the problem of deciding whether there is a schedule with flowtime less than or equal to a given value is NP-complete.
Stochastic global optimization methods part I: Clustering methods
In this stochastic approach to global optimization, clustering techniques are applied to identify local minima of a real valued objective function that are potentially global. Three different methods…