Pages that link to "Item:Q5919997"

The following pages link to Makespan minimization in online scheduling with machine eligibility (Q5919997):

Displaying 17 items.

• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
• A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups (Q2115789) (← links)
• Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
• Online scheduling of jobs with favorite machines (Q2289948) (← links)
• Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
• MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints (Q2421327) (← links)
• Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
• Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
• Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
• Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
• A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
• Semi-online scheduling on two identical parallel machines with initial-lookahead information (Q6561561) (← links)
• Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan (Q6594026) (← links)