Pages that link to "Item:Q4151721"

The following pages link to An Application of Bin-Packing to Multiprocessor Scheduling (Q4151721):

Displaying 50 items.

• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
• Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
• On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
• Dynamic fleet scheduling with uncertain demand and customer flexibility (Q395693) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
• Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information (Q473662) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Bee colony optimization for scheduling independent tasks to identical processors (Q519106) (← links)
• A composite algorithm for multiprocessor scheduling (Q544815) (← links)
• Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
• Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
• Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
• A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
• Scheduling jobs under increasing linear machine maintenance time (Q707693) (← links)
• Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments (Q712676) (← links)
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems (Q751515) (← links)
• Parallel machines scheduling with nonsimultaneous machine available time (Q757232) (← links)
• Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm (Q806667) (← links)
• Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
• A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
• Scheduling with flexible resources in parallel workcenters to minimize maximum completion time (Q850309) (← links)
• Linear time algorithms for parallel machine scheduling (Q856829) (← links)
• Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
• Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
• Heuristic stability: a permutation disarray measure (Q883278) (← links)
• Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• Scheduling batches on parallel machines with major and minor set-ups (Q918855) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• On the exact upper bound for the Multifit processor scheduling algorithm (Q920838) (← links)
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
• Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
• First fit decreasing scheduling on uniform multiprocessors (Q1061602) (← links)
• On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
• Multiprocessor scheduling: Combining LPT and MULTIFIT (Q1109673) (← links)
• Bin packing: Maximizing the number of pieces packed (Q1133327) (← links)
• Improved 0/1-interchange scheduling (Q1169295) (← links)
• Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
• A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm (Q1198607) (← links)
• A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (Q1210221) (← links)
• A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure (Q1278226) (← links)
• The \(k\)-partitioning problem (Q1298757) (← links)