Sciweavers

16596 search results - page 23 / 3320
» Generalized Assignment Problems
Sort
View
71
Voted
ADHOC
2005
122views more  ADHOC 2005»
14 years 9 months ago
Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
Hai Liu, Xiaohua Jia, Deying Li, Chan-Hee Lee
EOR
2006
125views more  EOR 2006»
14 years 9 months ago
A genetic algorithm for robotic assembly line balancing
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
Gregory Levitin, Jacob Rubinovitz, Boris Shnits
64
Voted
COR
2010
164views more  COR 2010»
14 years 9 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
LATIN
2000
Springer
15 years 1 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 4 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...