Pages that link to "Item:Q398866"
From MaRDI portal
The following pages link to An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866):
Displaying 7 items.
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
