Compact Scheduling In Open Shop With Zero-One Time Operations

DOI10.1080/03155986.1999.11732367OpenAlexW2404179657MaRDI QIDQ5888083

Michał Małafiejski, Unnamed Author, Krzysztof Giaro

Publication date: 21 April 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1999.11732367

zbMATH Keywords

bipartite graphNP-completenessconsecutive edge-coloringcompact scheduleno-wait schedule

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (9)

Interval incidence coloring of bipartite graphs ⋮ A comparison of integer and constraint programming models for the deficiency problem ⋮ A generalization of interval edge-colorings of graphs ⋮ Consecutive edge-coloring of the generalized \(\theta \)-graph ⋮ On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Interval incidence graph coloring ⋮ NP-hardness of compact scheduling in simplified open and flow shops. ⋮ Compact scheduling of zero-one time operations in multi-stage systems

This page was built for publication: Compact Scheduling In Open Shop With Zero-One Time Operations