Pages that link to "Item:Q1656199"

The following pages link to Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199):

Displaying 17 items.

• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
• Optimal online-list batch scheduling (Q990939) (← links)
• On-line scheduling a batch processing system to minimize total weighted job completion time (Q1768601) (← links)
• Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
• Medical rolling bearing fault prognostics based on improved extreme learning machine (Q2060047) (← links)
• Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode (Q2060062) (← links)
• Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
• Duplicating in batch scheduling (Q2468842) (← links)
• Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
• (Q2948897) (← links)
• Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
• Online Scheduling of Bounded Length Jobs to Maximize Throughput (Q3558919) (← links)
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
• (Q4828982) (← links)
• Online Scheduling via Learned Weights (Q5146898) (← links)
• ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (Q5462125) (← links)