Pages that link to "Item:Q4151721"
From MaRDI portal
The following pages link to An Application of Bin-Packing to Multiprocessor Scheduling (Q4151721):
Displaying 50 items.
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470) (← links)
- Performance of scheduling algorithms for no-wait flowshops with parallel machines (Q1310022) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Analytical loading models in flexible manufacturing systems (Q1319543) (← links)
- A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- A tighter bound for FFd algorithm (Q1594856) (← links)
- Exact and heuristic algorithms for thrift cyclic scheduling (Q1662520) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Identical parallel machine scheduling with time-dependent processing times (Q1704597) (← links)
- Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
- An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria (Q1762126) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- The multifit algorithm for set partitioning containing kernels (Q1807874) (← links)
- Bin packing with restricted piece sizes (Q1825652) (← links)
- A typology of cutting and packing problems (Q1825761) (← links)
- Bin packing and multiprocessor scheduling problems with side constraint on job types (Q1838290) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- An analysis of lower bound procedures for the bin packing problem (Q1886845) (← links)
- Approximability of scheduling with fixed jobs (Q1964484) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking (Q2043801) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
- A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry (Q2168721) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (Q2215198) (← links)
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities (Q2222085) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
- A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Exact performance of MULTIFIT for nonsimultaneous machines (Q2440111) (← links)
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (Q2448193) (← links)
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance (Q2472931) (← links)