Pages that link to "Item:Q1061599"
From MaRDI portal
The following pages link to Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599):
Displaying 38 items.
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines (Q906399) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- Heuristics for parallel machine scheduling with delivery times (Q1338896) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Controlling and assessing correlations of cost matrices in heterogeneous scheduling (Q1693202) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem (Q1861922) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors (Q2251359) (← links)
- Task assignment algorithms for two-type heterogeneous multiprocessors (Q2251393) (← links)
- Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
- Heuristics for scheduling unrelated parallel machines (Q2276868) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Parallel machine scheduling, linear programming, and parameter list scheduling heuristics (Q2770102) (← links)
- A heuristic for maximizing the number of on-time jobs on two uniform parallel machines (Q3423282) (← links)
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines (Q4202586) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
- Algorithmic Applications in Management (Q5710115) (← links)
- Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines (Q6551117) (← links)
