Pages that link to "Item:Q5433529"
From MaRDI portal
The following pages link to Parallel machine scheduling with job assignment restrictions (Q5433529):
Displaying 47 items.
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling (Q887890) (← links)
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Multiprocessor scheduling with machine allotment and parallelism constraints (Q1348915) (← links)
- Parallel machine scheduling with splitting jobs (Q1570839) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- Parallel machine scheduling with restricted job rejection (Q2399612) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- Scheduling unit-length jobs with machine eligibility restrictions (Q2503099) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
- Scheduling parallel machines with inclusive processing set restrictions (Q3518727) (← links)
- PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
- Parallel machine scheduling considering a job-splitting property (Q4671338) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
- Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments (Q5919347) (← links)
- An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing (Q6556084) (← links)
