Search Results - "Aarts, E. H. L."

Refine Results
  1. 1

    A computational study of constraint satisfaction for multiple capacitated job shop scheduling by Nuijten, W.P.M., Aarts, E.H.L.

    Published in European journal of operational research (19-04-1996)
    “…We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process…”
    Get full text
    Journal Article
  2. 2

    A local search template by Vaessens, R.J.M., Aarts, E.H.L., Lenstra, J.K.

    Published in Computers & operations research (01-11-1998)
    “…Many problems in combinatorial optimization are NP-hard which implies that it is generally believed that no algorithms exist that solve each instance of such a…”
    Get full text
    Journal Article
  3. 3

    A novel decomposition approach for on-line lot-sizing by Aarts, E.H.L., Reijnhoudt, M.F., Stehouwer, H.P., Wessels, J.

    Published in European journal of operational research (16-04-2000)
    “…A novel decomposition approach is presented for a class of on-line problems of Wagner–Whitin economic lot-sizing type. The decomposition is based on the fact…”
    Get full text
    Journal Article
  4. 4
  5. 5

    A neural network unification by Aarts, E. H. L., Ten Eikelder, H. M. M.

    Published in Statistica Neerlandica (01-07-2000)
    “…We study the relation between the asymptotic behaviour of synchronous Boltzmann machines and synchronous Hopfield networks. More specifically, we consider the…”
    Get full text
    Journal Article
  6. 6

    A polynomial-time algorithm for knapsack with divisible item sizes by Verhaegh, W.F.J., Aarts, E.H.L.

    Published in Information processing letters (28-05-1997)
    “…We consider the special case of the bounded knapsack problem with divisible item sizes, and present an algorithm that solves it in polynomial time. The main…”
    Get full text
    Journal Article
  7. 7

    Job Shop Scheduling by Simulated Annealing by van Laarhoven, Peter J. M, Aarts, Emile H. L, Lenstra, Jan Karel

    Published in Operations research (01-01-1992)
    “…We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a…”
    Get full text
    Journal Article
  8. 8

    Delay Management for Programmable Video Signal Processors by Smeets, M. L. G., Aarts, E. H. L., Essink, G., de Kock, E. A.

    “…We consider the problem of memory allocation for intermediate data in the mapping of video algorithms onto programmable video signal processors. The…”
    Get full text
    Conference Proceeding
  9. 9
  10. 10

    Multidimensional periodic scheduling: a solution approach by Verhaegh, W. F. J., Lippens, P. E. R., Aarts, E. H. L., van Meerbergen, J. L.

    “…We present a solution approach to the multidimensional periodic scheduling problem. We introduce the concept of multidimensional periodic operations in order…”
    Get full text
    Conference Proceeding
  11. 11
  12. 12

    A two-stage solution approach to multidimensional periodic scheduling by Verhaegh, W.F.J., Aarts, E.H.L., van Gorp, P.C.N., Lippens, P.E.R.

    “…We present a two-stage solution approach to the multidimensional periodic scheduling (MPS) problem. This problem originates from the design of high-throughput…”
    Get full text
    Journal Article
  13. 13

    Improved force-directed scheduling in high-throughput digital signal processing by Verhaegh, W.F.J., Lippens, P.E.R., Aarts, E.H.L., Korst, J.H.M., van Meerbergen, J.L., van der Werf, A.

    “…This paper discusses improved force-directed scheduling and its application in the design of high-throughput DSP systems, such as real-time video VLSL…”
    Get full text
    Journal Article
  14. 14

    The complexity of multidimensional periodic scheduling by Verhaegh, W.F.J., Lippens, P.E.R., Aarts, E.H.L., van Meerbergen, J.L., van der Werf, A.

    Published in Discrete Applied Mathematics (01-12-1998)
    “…We discuss the computational complexity of the multidimensional periodic scheduling problem. This problem originates from the assignment of periodic tasks to…”
    Get full text
    Journal Article
  15. 15

    The complexity of generalized retiming problems by de Fluiter, B., Aarts, E.H.L., Korst, J.H.M., Verhaegh, W.F.J., van der Werf, A.

    “…We discuss the complexity of a number of high-level synthesis problems that can be viewed as generalizations of the classical retiming problem introduced by…”
    Get full text
    Journal Article
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20