Single machine batch scheduling with release times

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization
Weitere Verfasser:	Gfeller, Beat (BerichterstatterIn), Peeters, Leon (BerichterstatterIn), Weber, Birgitta (BerichterstatterIn), Widmayer, Peter (BerichterstatterIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2009
Schlagworte:	Prozessmanagement > Scheduling-Verfahren > Rechnerbetrieb > Theorie > Aufsatz in Zeitschrift
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
An extension of Stein-Lovász theorem and some of its applications	2013	Lee, Guang-siang
Edge lifting and total domination in graphs	2013	Desormeaux, Wyatt J.
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle	2013	Karami, H.
Some variations on constrained minimum enclosing circle problem	2013
Coverage with k-transmitters in the presence of obstacles	2013
Discrete optimization with polynomially detectable boundaries and restricted level sets	2013	Zinder, Yakov
Clustering with or without the approximation	2013	Schalekamp, Frans
Minimum-segment convex drawings of 3-connected cubic plane graphs	2013
(p, q)-total labeling of complete graphs	2013
The partition method for poset-free families	2013	Griggs, Jerrold R.
The broadcast median problem in heterogeneous postal model	2013
A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra	2013	Eu, Sen-Peng
Distance two edge labelings of lattices	2013	Lin, Wensong
Colorability of mixed hypergraphs and their chromatic inversions	2013	Hegyháti, Máté
The game Grundy number of graphs	2013	Havet, Frédéric
The three-dimensional matching problem in Kalmanson matrices	2013	Polyakovskiy, Sergey
Parameterized complexity of k-anonymity: hardness and tractability	2013
Optimal key tree structure for two-user replacement and deletion problems	2013	Wu, Weiwei
Independent dominating sets in regular graphs	2013	Haviland, Julie
Embeddings of circulant networks	2013