Pages that link to "Item:Q489147"

The following pages link to Online over time scheduling on parallel-batch machines: a survey (Q489147):

Displaying 23 items.

• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
• Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848) (← links)
• Online over time processing of combinatorial problems (Q1617394) (← links)
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
• Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
• Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
• Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Online scheduling on a single machine with linear deteriorating processing times and delivery times (Q2082204) (← links)
• Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
• Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
• Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
• Online scheduling of jobs with kind release times and deadlines on a single machine (Q2422652) (← links)
• A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production (Q2691495) (← links)
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
• Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
• Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
• Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)