Pages that link to "Item:Q421784"
From MaRDI portal
The following pages link to The just-in-time scheduling problem in a flow-shop scheduling system (Q421784):
Displaying 20 items.
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- The proportionate flow shop total tardiness problem (Q2178064) (← 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)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem (Q5059236) (← links)
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system (Q6054756) (← 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)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
- On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
- A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times (Q6568444) (← links)
