An Application of Bin-Packing to Multiprocessor Scheduling
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
- Tighter approximation bounds for LPT scheduling in two special cases
- First fit decreasing scheduling on uniform multiprocessors
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- Bin packing: Maximizing the number of pieces packed
- Improved 0/1-interchange scheduling
- Tighter bound for MULTIFIT scheduling on uniform processors
- 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
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- A note on MULTIFIT scheduling for uniform machines
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- The \(k\)-partitioning problem
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Analytical loading models in flexible manufacturing systems
- A robust strategy approach to a strategic mobility problem
- List scheduling algorithms to minimize the makespan on identical parallel machines
- Approximate algorithms for the \(P\parallel C_{\max}\) problem
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- An exact algorithm for the identical parallel machine scheduling problem.
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- A tighter bound for FFd algorithm
- Exact and heuristic algorithms for thrift cyclic scheduling
- Multiprofessor scheduling
- Approximation for scheduling on uniform nonsimultaneous parallel machines
- Identical parallel machine scheduling with time-dependent processing times
- Minimizing the makespan on two identical parallel machines with mold constraints
- Scheduling on uniform processors with at most one downtime on each machine
- Scheduling identical parallel machines with tooling constraints
- A cutting plane approach for integrated planning and scheduling
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
- The effect of machine availability on the worst-case performance of LPT
- The multifit algorithm for set partitioning containing kernels
- Bin packing with restricted piece sizes
- A typology of cutting and packing problems
- Bin packing and multiprocessor scheduling problems with side constraint on job types
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Parallel machine scheduling under a grade of service provision
- An analysis of lower bound procedures for the bin packing problem
- Approximability of scheduling with fixed jobs
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- Bin packing problem with conflicts and item fragmentation
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
- 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
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- An introduction to stochastic bin packing-based server consolidation with conflicts
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry
- The longest processing time rule for identical parallel machines revisited
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- Improved approximation algorithms for two-stage flowshops scheduling problem
- New approximation bounds for LPT scheduling
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
- A note on posterior tight worst-case bounds for longest processing time schedules
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- Exact performance of MULTIFIT for nonsimultaneous machines
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- Competitive strategies of U.S. presidential candidates in election campaigns
- Minimizing labor requirements in a periodic vehicle loading problem
- Scheduling advertisements on a web page to maximize revenue
- Machine scheduling performance with maintenance and failure
- Parallel machine scheduling with nested processing set restrictions
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A linear time approximation algorithm for multiprocessor scheduling
- Performance of Heuristics for a Computer Resource Allocation Problem
- On scheduling parallel machines with two setup classes
- Energy-oriented scheduling based on evolutionary algorithms
- Branch and Price for Chance-Constrained Bin Packing
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
- A Packing Problem You Can Almost Solve by Sitting on Your Suitcase
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Dynamic fleet scheduling with uncertain demand and customer flexibility
- NP-Complete operations research problems and approximation algorithms
- Approximation scheduling algorithms: a survey
- Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems
- Scheduling on same-speed processors with at most one downtime on each machine
- Computer-assisted proof of performance ratios for the differencing method
- A hierarchical approach for metal parts fabrication
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- scientific article; zbMATH DE number 1559404 (Why is no real title available?)
- Scheduling with product family set-up times: an application in TFT LCD manufacturing
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
- Unrelated parallel machine scheduling -- perspectives and progress
- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems
- Bee colony optimization for scheduling independent tasks to identical processors
- List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
- A composite algorithm for multiprocessor scheduling
- scientific article; zbMATH DE number 2230249 (Why is no real title available?)
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)
