Directory UMM :Data Elmu:jurnal:O:Operations Research Letters:Vol26.Issue4.2000:
Teks penuh
Gambar
Dokumen terkait
In the rst two graphs, the role of rank inequalities is to accomplish a formulation strengthening similar to the one from clique inequal- ities, but with a smaller number of cuts.
This makes it natural to wonder (at least in the primal and dual network ow cases) if our weakly polynomial bound for minimum ratio canceling can be strengthened to a
In this note, we study the competitive ratio of on-line algorithms for maximizing the number of early jobs on a single machine in the preemption-restart model.. Sgall [7] gives
The rst example is when the given graph is “almost” acyclic in the sense that there exists a small subset T of nodes, the deletion of which yields an acyclic graph.. In this case,
In the usual framework of the expected-utility model and unidimensional random incomes or payos, dominance of the rst degree corresponds to the assumption that more income is
(The factor of 6 can be tightened; however, even for identical machines the factor is 2, as is shown by the case of m + 1 jobs with the same processing times.) The bound on the
Yuan [10] showed that the single machine batch delivery problem to minimize the sum of the total weighted earliness and tardiness and delivery costs of the tardy jobs is NP-complete
We have studied the permutation # owshop scheduling problem with an increasing and de- creasing series of dominating machines to minimize one of the " ve regular
