A Two-Stage Flexible Flowshop Problem with Deterioration (Englisch)
- Neue Suche nach: Gong, H.
- Neue Suche nach: Tang, L.
- Neue Suche nach: Gong, H.
- Neue Suche nach: Tang, L.
- Neue Suche nach: Hu, Xiaodong
- Neue Suche nach: Wang, Jie
In:
Annual international computing and combinatorics conference; COCOON 2008,
5092
;
651-660
;
2008
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Print
-
Titel:A Two-Stage Flexible Flowshop Problem with Deterioration
-
Beteiligte:
-
Kongress:14th, Annual international computing and combinatorics conference; COCOON 2008, ; 2008 ; Dailian, China
-
Erschienen in:LECTURE NOTES IN COMPUTER SCIENCE , 5092 ; 651-660
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Berlin
-
Erscheinungsdatum:01.01.2008
-
Format / Umfang:10 pages
-
Anmerkungen:Includes bibliographical references and index.
-
ISBN:
-
ISSN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Efficient Compression of Web GraphsAsano, Y. / Miyawaki, Y. / Nishizeki, T. et al. | 2008
- 12
-
Damaged BZip Files Are Difficult to RepairHundt, C. / Ochsenfahrt, U. et al. | 2008
- 22
-
Isoperimetric Problem and Meta-fibonacci SequencesBharadwaj, B.V.S. / Chandran, L.S. / Das, A. et al. | 2008
- 31
-
On the Complexity of Equilibria Problems in Angel-Daemon GamesGabarro, J. / Garcia, A. / Serna, M. et al. | 2008
- 41
-
Average-Case Competitive Analyses for One-Way TradingFujiwara, H. / Iwama, K. / Sekiguchi, Y. et al. | 2008
- 52
-
On the Monotonicity of Weak SearchingYang, B. / Cao, Y. et al. | 2008
- 62
-
VC Dimension Bounds for Analytic Algebraic ComputationsMontana, J.L. / Pardo, L.M. / Callau, M. et al. | 2008
- 72
-
Resource Bounded Frequency Computations with Three ErrorsHertrampf, U. / Minnameier, C. et al. | 2008
- 82
-
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box ModelFu, B. / Chen, Z. et al. | 2008
- 92
-
Smallest Formulas for Parity of 2^k Variables Are Essentially UniqueTarui, J. et al. | 2008
- 100
-
Counting Polycubes without the Dimensionality CurseAleksandrowicz, G. / Barequet, G. et al. | 2008
- 110
-
Polychromatic Colorings of n-Dimensional Guillotine-PartitionsKeszegh, B. et al. | 2008
- 119
-
The Computational Complexity of Link BuildingOlsen, M. et al. | 2008
- 130
-
Improved Parameterized Algorithms for Weighted 3-Set PackingWang, J. / Feng, Q. et al. | 2008
- 140
-
Structural Identifiability in Low-Rank Matrix FactorizationFritzilas, E. / Rios-Solis, Y.A. / Rahmann, S. et al. | 2008
- 149
-
Complexity of Counting the Optimal SolutionsHermann, M. / Pichler, R. et al. | 2008
- 160
-
The Orbit Problem Is in the GapL HierarchyArvind, V. / Vijayaraghavan, T.C. et al. | 2008
- 170
-
Quantum Separation of Local Search and Fixed Point ComputationChen, X. / Sun, X. / Teng, S.-H. et al. | 2008
- 180
-
Multi-party Quantum Communication Complexity with Routed MessagesTani, S. / Nakanishi, M. / Yamashita, S. et al. | 2008
- 191
-
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying AssignmentsSato, T. / Amano, K. / Takimoto, E. / Maruoka, A. et al. | 2008
- 204
-
Approximating Alternative SolutionsKruger, M. / Hempel, H. et al. | 2008
- 215
-
Dimensions of Points in Self-similar FractalsLutz, J.H. / Mayordomo, E. et al. | 2008
- 225
-
Visual Cryptography on GraphsLu, S. / Manchala, D. / Ostrovsky, R. et al. | 2008
- 235
-
Algebraic Cryptanalysis of CTRU CryptosystemVats, N. et al. | 2008
- 245
-
Detecting Community Structure by Network VectorizationRen, W. / Yan, G. / Lin, G. / Du, C. / Han, X. et al. | 2008
- 255
-
Quasi-bicliques: Complexity and Binding PairsLiu, X. / Li, J. / Wang, L. et al. | 2008
- 265
-
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene SynthesisCondon, A. / Manuch, J. / Thachuk, C. et al. | 2008
- 276
-
Genome Halving under DCJ RevisitedMixtacki, J. et al. | 2008
- 287
-
Haplotype Inferring Via Galled-Tree Networks Is NP-CompleteGupta, A. / Manuch, J. / Stacho, L. / Zhao, X. et al. | 2008
- 299
-
Adjacent Swaps on StringsChitturi, B. / Sudborough, H. / Voit, W. / Feng, X. et al. | 2008
- 309
-
Efficient Algorithms for SNP Haplotype Block Selection ProblemsLin, Y.-L. et al. | 2008
- 319
-
Sequence Alignment Algorithms for Run-Length-Encoded StringsHuang, G.S. / Liu, J.J. / Wang, Y.L. et al. | 2008
- 331
-
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular PermutationsLou, X. / Zhu, D. et al. | 2008
- 342
-
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GIXie, M. / Wang, J. / Chen, J. et al. | 2008
- 352
-
Voronoi Diagram of Polygonal Chains under the Discrete Frechet DistanceBereg, S. / Buchin, K. / Buchin, M. / Gavrilova, M. / Zhu, B. et al. | 2008
- 363
-
On Center Regions and Balls Containing Many PointsSmorodinsky, S. / Sulovsky, M. / Wagner, U. et al. | 2008
- 374
-
On Unfolding 3D Lattice Polygons and 2D Orthogonal TreesPoon, S.-H. et al. | 2008
- 385
-
New Algorithms for Online Rectangle Filling with k-LookaheadWang, H. / Chaudhary, A. / Chen, D.Z. et al. | 2008
- 395
-
Geometric Spanner of Objects under L~1 DistanceZhu, Y. / Xu, J. / Yang, Y. / Katoh, N. / Tanigawa, S.-i. et al. | 2008
- 405
-
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner ConstraintsHong, S.-H. / Nagamochi, H. et al. | 2008
- 415
-
A New Characterization of P~6-Free Graphsvan t Hof, P. / Paulusma, D. et al. | 2008
- 425
-
Maximum Connected Domatic Partition of Directed Path Graphs with Single JunctionMito, M. / Fujita, S. et al. | 2008
- 434
-
Efficient Algorithms for the k Smallest Cuts EnumerationYeh, L.-P. / Wang, B.-F. et al. | 2008
- 444
-
Covering Directed Graphs by In-TreesKamiyama, N. / Katoh, N. et al. | 2008
- 458
-
On Listing, Sampling, and Counting the Chordal Graphs with Edge ConstraintsKijima, S. / Kiyomi, M. / Okamoto, Y. / Uno, T. et al. | 2008
- 468
-
Probe Ptolemaic GraphsChandler, D.B. / Chang, M.-S. / Kloks, T. / Le, V.B. / Peng, S.-L. et al. | 2008
- 478
-
Diagnosability of Two-Matching Composition NetworksHsieh, S.-Y. / Lee, C.-W. et al. | 2008
- 487
-
The Iterated Restricted Immediate Snapshot ModelRajsbaum, S. / Raynal, M. / Travers, C. et al. | 2008
- 498
-
Finding Frequent Items in a Turnstile Data StreamHung, R.Y.S. / Lai, K.F. / Ting, H.F. et al. | 2008
- 510
-
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk ConstraintsNgo, H.Q. / Wang, Y. / Le, A. et al. | 2008
- 521
-
Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion CostWu, W. / Li, M. / Chen, E. et al. | 2008
- 531
-
Throughput Maximization with Traffic Profile in Wireless Mesh NetworkHuang, H. / Peng, Y. et al. | 2008
- 541
-
Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power AdjustmentLi, D. / Du, H. / Liu, L. / Huang, S.C.-H. et al. | 2008
- 551
-
(6 + epsilon )-Approximation for Minimum Weight Dominating Set in Unit Disk GraphsGao, X. / Huang, Y. / Zhang, Z. / Wu, W. et al. | 2008
- 558
-
Spectrum Bidding in Wireless Networks and RelatedLi, X.-Y. / Xu, P. / Tang, S. / Chu, X. et al. | 2008
- 568
-
(1 + rho )-Approximation for Selected-Internal Steiner Minimum TreeLi, X. / Huang, Y. / Zou, F. / Kim, D. / Wu, W. et al. | 2008
- 577
-
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex CapacitiesZhang, X. / Liang, W. / Chen, G. et al. | 2008
- 587
-
Spreading MessagesChang, C.-L. / Lyuu, Y.-D. et al. | 2008
- 600
-
On Some City Guarding ProblemsBao, L. / Bereg, S. / Daescu, O. / Ntafos, S. / Zhou, J. et al. | 2008
- 611
-
Optimal Insertion of a Segment Highway in a City MetricKorman, M. / Tokuyama, T. et al. | 2008
- 621
-
Approximating the Generalized Capacitated Tree-Routing ProblemMorsy, E. / Nagamochi, H. et al. | 2008
- 631
-
Column Generation Algorithms for the Capacitated m-Ring-Star ProblemHoshino, E.A. / de Souza, C.C. et al. | 2008
- 642
-
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single MachineLiu, P. / Tang, L. et al. | 2008
- 651
-
A Two-Stage Flexible Flowshop Problem with DeteriorationGong, H. / Tang, L. et al. | 2008
- 661
-
A Lower Bound for the On-Line Preemptive Machine Scheduling with l~p NormShuai, T. / Du, D. et al. | 2008
- 670
-
The Coordination of Two Parallel Machines Scheduling and Batch DeliveriesGong, H. / Tang, L. et al. | 2008