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 6 items.
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← 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)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← 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)
