Pages that link to "Item:Q1268852"
From MaRDI portal
The following pages link to Approximation schemes for scheduling on parallel machines (Q1268852):
Displaying 50 items.
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines (Q342416) (← links)
- On multiprocessor temperature-aware scheduling problems (Q398885) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Approximation algorithms for extensible bin packing (Q880529) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Speed scaling of tasks with precedence constraints (Q927406) (← links)
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202) (← links)
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan (Q976111) (← links)
- On-line scheduling with extendable working time on a small number of machines (Q1007518) (← links)
- Complexity of min-max subsequence problems (Q1014423) (← links)
- Power-aware scheduling for makespan and flow (Q1041350) (← links)
- A parallel approximation scheme for the multiprocessor scheduling problem (Q1606878) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- Vector scheduling with rejection on a single machine (Q1743644) (← links)
- Approximation schemes for the min-max starting time problem (Q1762841) (← links)
- Scheduling reclaimer operations in the stockyard to minimize makespan (Q1782041) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- Approximation schemes for scheduling on uniformly related and identical parallel machines (Q1879359) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
- Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
- EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
- Exact and meta-heuristic approaches for the production leveling problem (Q2163752) (← links)
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Simultaneous approximation ratios for parallel machine scheduling problems (Q2326082) (← links)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
