Pages that link to "Item:Q411231"

The following pages link to Optimal on-line algorithms for one batch machine with grouped processing times (Q411231):

Displaying 16 items.

• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
• Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
• Optimally competitive list batching (Q837154) (← links)
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart (Q1666180) (← links)
• Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
• A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199) (← links)
• Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
• Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
• Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
• On-line algorithms for minimizing makespan on batch processing machines (Q2741218) (← links)
• Algorithm Theory - SWAT 2004 (Q5315404) (← links)
• Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)