Pages that link to "Item:Q835569"
From MaRDI portal
The following pages link to Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569):
Displaying 17 items.
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866) (← links)
- 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)
- 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)
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← 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)
- 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)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
- A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)