Pages that link to "Item:Q880513"
From MaRDI portal
The following pages link to Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513):
Displaying 15 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)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← 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)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← 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)
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores (Q2835690) (← 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)
- No-Wait Scheduling for Locks (Q5139604) (← 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)