Pages that link to "Item:Q290202"

The following pages link to A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer (Q290202):

Displaying 21 items.

• Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
• Improved semi-online makespan scheduling with a reordering buffer (Q396624) (← links)
• Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Online scheduling with rearrangement on two related machines (Q627161) (← links)
• Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
• Online scheduling with a buffer on related machines (Q711400) (← links)
• Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
• Online scheduling with reassignment (Q935241) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• A note on on-line scheduling with partial information (Q1886493) (← links)
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488) (← links)
• A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
• Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
• Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
• (Q5009506) (← links)
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
• SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
• Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905) (← links)