Sciweavers

33 search results - page 3 / 7
» Size-reduction heuristics for the unrelated parallel machine...
Sort
View
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
13 years 10 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
EOR
2002
105views more  EOR 2002»
13 years 6 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
IJMTM
2011
190views more  IJMTM 2011»
13 years 1 months ago
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...
MP
2007
145views more  MP 2007»
13 years 5 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
COR
2006
96views more  COR 2006»
13 years 6 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan