Compact Scheduling In Open Shop With Zero-One Time Operations

DOI10.1080/03155986.1999.11732367MaRDI QIDQ5888083zbMATH OpenOpenAlexFDO

Authors Krzysztof Giaro, Michal Malafiejski

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)

Recommendations

• Compact scheduling of zero-one time operations in multi-stage systems
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• NP-hardness of compact scheduling in simplified open and flow shops.
• Chromatic scheduling in a cyclic open shop
• The cyclic compact open-shop scheduling problem

Cited in

(11)

• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Compact scheduling of zero-one time operations in multi-stage systems
• Interval incidence graph coloring
• Interval incidence coloring of bipartite graphs
• A generalization of interval edge-colorings of graphs
• Consecutive edge-coloring of the generalized \(\theta \)-graph
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A comparison of integer and constraint programming models for the deficiency problem
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
• On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic
• NP-hardness of compact scheduling in simplified open and flow shops.

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

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