Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Gyrgy Dsa
Information about the author Gyrgy Dsa will soon be added to the site.
Found
12 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Semi-online hierarchical scheduling problems with buffer or rearrangements
2013
In this paper, we consider semi‐online hierarchical scheduling problems on two...
A note on a selfish bin packing problem
2013
In this paper, we consider a selfish bin packing problem, where each item is a selfish...
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on‐line scheduling
2011
We consider semi on‐line scheduling on two uniform machines. The speed of the...
Online scheduling with a buffer on related machines
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to...
The general algorithm LPT(k) for scheduling identical parallel machines
2006
The paper is devoted to investigate the general algorithm LPT(k). First the tasks are...
Two almost easy problems
2005
We are looking for shortest path, or maximum flow in time-dependent networks. The...
Extension of algorithm list scheduling for a semi-online scheduling problem
2007
A general algorithm, called ALG, for online and semi-online scheduling problem...
Scheduling with machine cost and rejection
2006
In this paper we consider the scheduling problem with machine cost and rejection...
A longest processing time algorithm for scheduling identical parallel machines
2004
This paper is devoted to some heuristics for the problem P ‖ C max . This...
Heuristical methods for the relaxed two-dimensional rectangle scheduling problem
1999
We are dealing with a problem of one-resource-constrained scheduling: How can a number...
Generalized multifit-type methods for scheduling parallel identical machines
1999
We investigate a very well known NP-complete problem of the scheduling-theory:...
Generalized multifit-type methods II
2000
We investigate a well known NP-complete problem of the scheduling theory: scheduling...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers