Pages that link to "Item:Q2958665"
From MaRDI portal
The following pages link to Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665):
Displaying 13 items.
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem (Q1723298) (← 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)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems (Q2644259) (← links)
- A note on just-in-time scheduling on flow shop machines (Q2801107) (← 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)
- An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine (Q6619607) (← links)
- Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)
