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

DOI10.1016/J.DAM.2003.09.010zbMATH Open1056.05059OpenAlexW2001298633MaRDI QIDQ705502FDOQ705502

Authors Krzysztof Giaro, Marek Kubale

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

Bipartite graphCompact scheduleConsecutive edge-coloringFlow shopMixed shopOpen shopPolynomial algorithm

Mathematics Subject Classification ID

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

Recommendations

• NP-hardness of compact scheduling in simplified open and flow shops.
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Chromatic scheduling in a cyclic open shop
• scientific article; zbMATH DE number 41713
• A preemptive open shop scheduling problem with one resource

Cites work

• scientific article; zbMATH DE number 165470 (Why is no real title available?)
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• scientific article; zbMATH DE number 1104338 (Why is no real title available?)
• scientific article; zbMATH DE number 1161387 (Why is no real title available?)
• scientific article; zbMATH DE number 1998802 (Why is no real title available?)
• scientific article; zbMATH DE number 951847 (Why is no real title available?)
• scientific article; zbMATH DE number 1409249 (Why is no real title available?)
• Compact Cylindrical Chromatic Scheduling
• Compact Scheduling In Open Shop With Zero-One Time Operations
• Consecutive colorings of the edges of general graphs
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Investigation on interval edge-colorings of graphs
• On interval colourings of bi-regular bipartite graphs
• On the deficiency of bipartite graphs
• The NP-Completeness of Edge-Coloring

Cited in

(28)

• Interval colourable orientations of graphs
• Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
• Consecutive edge-coloring of the generalized \(\theta \)-graph
• On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
• Interval cyclic edge-colorings of graphs
• Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
• A note on one-sided interval edge colorings of bipartite graphs
• Further results on the deficiency of graphs
• Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
• Cyclic deficiency of graphs
• On interval colouring reorientation number of oriented graphs
• Interval colorings of graphs—Coordinated and unstable no‐wait schedules
• On interval edge colorings of biregular bipartite graphs with small vertex degrees
• Improper interval edge colorings of graphs
• A generalization of interval edge-colorings of graphs
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
• Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
• On resistance of graphs
• Interval non-edge-colorable bipartite graphs and multigraphs
• Consecutive colouring of oriented graphs
• Interval incidence graph coloring
• Interval edge-colorings of composition of graphs
• On Eulerian extensions and their application to no-wait flowshop scheduling
• Forbidden structures for planar perfect consecutively colourable graphs
• On path factors of \((3,4)\)-biregular bigraphs
• Some remarks on interval colorings of complete tripartite and biregular graphs
• One-sided interval edge-colorings of bipartite graphs
• Compact Scheduling In Open Shop With Zero-One Time Operations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705502)