An Application of Bin-Packing to Multiprocessor Scheduling
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Approximation algorithms for demand-based job scheduling with reconfigurable resources
- A typology of cutting and packing problems
- Multiprofessor scheduling
- Scheduling web advertisements: a note on the minspace problem
- Minimizing labor requirements in a periodic vehicle loading problem
- A robust strategy approach to a strategic mobility problem
- Scheduling jobs under increasing linear machine maintenance time
- Identical parallel machine scheduling with time-dependent processing times
- The multifit algorithm for set partitioning containing kernels
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- A tabu search algorithm for unspecified parallel machine scheduling with shift consideration
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- Approximate algorithms for the \(P\parallel C_{\max}\) problem
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- The \(k\)-partitioning problem
- Unrelated parallel machine scheduling -- perspectives and progress
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Competitive strategies of U.S. presidential candidates in election campaigns
- Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems
- First fit decreasing scheduling on uniform multiprocessors
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- An analysis of lower bound procedures for the bin packing problem
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
- Update on the asymptotic optimality of LPT
- Scheduling on uniform processors with at most one downtime on each machine
- Improved 0/1-interchange scheduling
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Bee colony optimization for scheduling independent tasks to identical processors
- Scheduling with product family set-up times: an application in TFT LCD manufacturing
- Bin packing and multiprocessor scheduling problems with side constraint on job types
- A note on posterior tight worst-case bounds for longest processing time schedules
- scientific article; zbMATH DE number 1559404 (Why is no real title available?)
- Bin packing problem with conflicts and item fragmentation
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Packing-based branch-and-bound for discrete malleable task scheduling
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- Bin packing with restricted piece sizes
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems
- Non-clairvoyant makespan minimization scheduling with predictions
- Dynamic fleet scheduling with uncertain demand and customer flexibility
- Minimizing the makespan on two identical parallel machines with mold constraints
- Approximation scheduling algorithms: a survey
- List scheduling algorithms to minimize the makespan on identical parallel machines
- A characterization of optimal multiprocessor schedules and new dominance rules
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing
- Parallel machines scheduling with nonsimultaneous machine available time
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- A generalized combination of parallel machine scheduling and path
- Approximation for scheduling on uniform nonsimultaneous parallel machines
- An exact algorithm for the identical parallel machine scheduling problem.
- Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture
- A hierarchical approach for metal parts fabrication
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- A composite algorithm for multiprocessor scheduling
- Exact performance of MULTIFIT for nonsimultaneous machines
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Classification and evaluation of the algorithms for vector bin packing
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- 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
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
- Lower bounds and heuristic algorithms for the k_i-partitioning problem
- Branch and Price for Chance-Constrained Bin Packing
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Scheduling on same-speed processors with at most one downtime on each machine
- Linear time algorithms for parallel machine scheduling
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- A tighter bound for FFd algorithm
- scientific article; zbMATH DE number 2230249 (Why is no real title available?)
- Parallel machine scheduling under a grade of service provision
- A state-of-the-art review of parallel-machine scheduling research
- Computer-assisted proof of performance ratios for the differencing method
- The effect of machine availability on the worst-case performance of LPT
- Tighter approximation bounds for LPT scheduling in two special cases
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- The constrained parallel-machine scheduling problem with divisible processing times and penalties
- Performance of the LPT algorithm in multiprocessor scheduling
- Adaptive Bin Packing with Overflow
- Scheduling batches on parallel machines with major and minor set-ups
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- The longest processing time rule for identical parallel machines revisited
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
- Approximability of scheduling with fixed jobs
- Performance ratios of the Karmarkar-Karp differencing method
- Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
- Tighter bound for MULTIFIT scheduling on uniform processors
This page was built for publication: An Application of Bin-Packing to Multiprocessor Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151721)
