Pages that link to "Item:Q4245414"

The following pages link to Minimizing makespan on a single batch processing machine with dynamic job arrivals (Q4245414):

Displaying 50 items.

• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
• 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)
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← 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)
• On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
• Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
• The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
• Optimal online-list batch scheduling (Q990939) (← links)
• Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
• Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
• On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
• Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
• A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348) (← links)
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
• Scheduling one batch processor subject to job release dates (Q1582073) (← links)
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
• Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• Two-stage hybrid flow shop scheduling with dynamic job arrivals (Q1762160) (← links)
• Minimizing makespan with release times on identical parallel batching machines (Q1775064) (← links)
• On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
• On scheduling an unbounded batch machine (Q1870002) (← links)
• Minimizing makespan in batch machine scheduling (Q1882631) (← links)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← links)
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms (Q2255056) (← links)
• A survey of dynamic scheduling in manufacturing systems (Q2268515) (← links)