Results 211 to 220 of about 32,346 (266)
Some of the next articles are maybe not open access.
A scheduling problem in test generation
Proceedings 13th IEEE VLSI Test Symposium, 2002The order of faults which are targeted for test-pattern generation affects both the processing time for test generation and the number of test-patterns. This order is referred to as a test generation schedule. In this paper, we consider the test generation scheduling problem which minimizes the cost of testing. We analyze the effect of scheduling based
Tomoo Inoue +2 more
openaire +1 more source
A Generalized Machine-Scheduling Algorithm
Operational Research Quarterly (1970-1977), 1970It is proposed to treat a general machine-job-scheduling problem using a branch-and-bound method. Here the general problem is that in which the routing of any job through the machines is specified in advance but is independent of the routing of any other job. In addition there is no requirement for the job to visit all machines.
John M. Charlton, Carl C. Death
openaire +2 more sources
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source
The general lotsizing and scheduling problem
Operations-Research-Spektrum, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fleischmann, Bernhard, Meyr, Herbert
openaire +4 more sources
Parallel loop generation and scheduling
The Journal of Supercomputing, 2009Loop tiling is an efficient loop transformation, mainly applied to detect coarse-grained parallelism in loops. It is a difficult task to apply n-dimensional non-rectangular tiles to generate parallel loops. This paper offers an efficient scheme to apply non-rectangular n-dimensional tiles in non-rectangular iteration spaces, to generate parallel loops.
Shahriar Lotfi, Saeed Parsa
openaire +1 more source
Optimal generation scheduling of a microgrid
2012 3rd IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe), 2012This paper presents an efficient method for the optimal generation scheduling of a microgrid comprising various distributed generators (DG), storage device. To give the optimal operation strategy, an optimization model is proposed respecting various distributed energy resources (DER) constraints and system constraints.
Xiong Wu 0003, Xiuli Wang, Zhaohong Bie
openaire +1 more source
Generalized multiprocessor scheduling
1996This paper presents some new results on homogeneous multi-processor scheduling. Given the lengths, precedences and speedup functions of a set of tasks, the optimal scheduling problem is to determine the number of processors assigned to each task and the task sequencing to minimize the completion time.
Li, Zhonghua, Kirkham, Chris C
openaire +2 more sources
Parallel Machine Scheduling by Column Generation [PDF]
Operations Research, 1999 Parallel machine scheduling problems concern the scheduling of njobs on mmachines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only 𝒩𝒫-hard, but also very hard from a practical point of view.
J. M. van den Akker +2 more
exaly +5 more sources
Sports scheduling with generalized breaks
2011 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), 2011In sports scheduling, a team is said to have a break when it plays two home (or two away) matches in consecutive rounds. In this paper, we generalize this concept by also considering pairs of nonconsecutive rounds. We determine the complexity of the problem of finding a set of home-away patterns minimizing the number of generalized breaks when a so ...
Dries R. Goossens, Frits C. R. Spieksma
openaire +1 more source