Pages that link to "Item:Q1882631"

The following pages link to Minimizing makespan in batch machine scheduling (Q1882631):

Displaying 16 items.

• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
• Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
• Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
• Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
• On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
• Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)