Compact scheduling of zero-one time operations in multi-stage systems

DOI10.1016/j.dam.2003.09.010zbMath1056.05059OpenAlexW2001298633MaRDI QIDQ705502

Marek Kubale, Krzysztof Giaro

Publication date: 31 January 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.010

zbMATH Keywords

Open shopFlow shopPolynomial algorithmBipartite graphCompact scheduleConsecutive edge-coloringMixed shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items (25)

Further results on the deficiency of graphs ⋮ Interval cyclic edge-colorings of graphs ⋮ One-sided interval edge-colorings of bipartite graphs ⋮ On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs ⋮ A generalization of interval edge-colorings of graphs ⋮ A note on one-sided interval edge colorings of bipartite graphs ⋮ On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs ⋮ On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Interval colorings of graphs—Coordinated and unstable no‐wait schedules ⋮ Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs ⋮ On Eulerian extensions and their application to no-wait flowshop scheduling ⋮ On resistance of graphs ⋮ Consecutive edge-coloring of the generalized \(\theta \)-graph ⋮ Improper interval edge colorings of graphs ⋮ Consecutive colouring of oriented graphs ⋮ Interval edge-colorings of composition of graphs ⋮ Forbidden structures for planar perfect consecutively colourable graphs ⋮ Interval incidence graph coloring ⋮ Interval edge-colorings of complete graphs and \(n\)-dimensional cubes ⋮ Cyclic deficiency of graphs ⋮ On path factors of \((3,4)\)-biregular bigraphs ⋮ Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs ⋮ Some remarks on interval colorings of complete tripartite and biregular graphs ⋮ Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs

Cites Work

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• On the deficiency of bipartite graphs
• Investigation on interval edge-colorings of graphs
• The NP-Completeness of Edge-Coloring
• Compact Cylindrical Chromatic Scheduling
• Compact Scheduling In Open Shop With Zero-One Time Operations
• Consecutive colorings of the edges of general graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compact scheduling of zero-one time operations in multi-stage systems