Pages that link to "Item:Q5888083"
From MaRDI portal
The following pages link to Compact Scheduling In Open Shop With Zero-One Time Operations (Q5888083):
Displaying 11 items.
- A comparison of integer and constraint programming models for the deficiency problem (Q342299) (← links)
- A generalization of interval edge-colorings of graphs (Q602763) (← links)
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Interval incidence graph coloring (Q2255045) (← links)
- Consecutive edge-coloring of the generalized \(\theta \)-graph (Q2457013) (← links)
- Interval incidence coloring of bipartite graphs (Q2636801) (← links)
- Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops (Q4304829) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
