Pages that link to "Item:Q2400041"
From MaRDI portal
The following pages link to Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041):
Displaying 14 items.
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← 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)
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← 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)
- Algorithms for a two‐machine flowshop problem with jobs of two classes (Q6090515) (← links)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
