Pages that link to "Item:Q2387307"
From MaRDI portal
The following pages link to A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307):
Displayed 12 items.
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
- Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)