Pages that link to "Item:Q2294891"
From MaRDI portal
The following pages link to On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891):
Displaying 13 items.
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
- (Q3023691) (← links)
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)