Sciweavers

1125 search results - page 90 / 225
» On the job rotation problem
Sort
View
144
Voted
ICALP
2005
Springer
15 years 6 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
TASE
2008
IEEE
15 years 18 days ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
90
Voted
AAAI
2000
15 years 2 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
100
Voted
JCIT
2010
127views more  JCIT 2010»
14 years 7 months ago
Review of PSE (Problem Solving Environment) Study
This review paper presents an overview of the current state of the art in Problem Solving Environments (PSE). PSE provides integrated human-friendly innovative computational servi...
Shigeo Kawata
154
Voted
CDC
2010
IEEE
183views Control Systems» more  CDC 2010»
14 years 7 months ago
Application of potent potential functions in eye/head movement control
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...
Bijoy K. Ghosh, Indika Wijayasinghe