Parallel machine scheduling with job assignment restrictions
From MaRDI portal
Recommendations
- Fast approximation algorithms for job scheduling with processing set restrictions
- Restricted assignment scheduling with resource constraints
- Parallel machine scheduling with nested processing set restrictions
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Scheduling unit length jobs with parallel nested machine processing set restrictions
Cites work
- Bounds for Certain Multiprocessing Anomalies
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- scientific article; zbMATH DE number 2221456 (Why is no real title available?)
Cited in
(48)- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Parallel machine scheduling with splitting jobs
- Multiprofessor scheduling
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Restricted assignment scheduling with resource constraints
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- Parallel dedicated machines scheduling with chain precedence constraints
- Multipurpose machine scheduling with rejection and identical job processing times
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- Parallel machine scheduling with nested job assignment restrictions
- Parallel machine scheduling with restricted job rejection
- Parallel batch scheduling with nested processing set restrictions
- Optimal algorithms for semi-online machine covering on two hierarchical machines
- Scheduling unit-length jobs with machine eligibility restrictions
- On some special cases of the restricted assignment problem
- Parallel machine scheduling with nested processing set restrictions
- Scheduling uniform machines with restricted assignment
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Preemptive scheduling algorithms with nested processing set restriction
- Smoothed performance guarantees for local search
- Fast approximation algorithms for job scheduling with processing set restrictions
- Stable assignment with couples: parameterized complexity and local search
- Parallel machine scheduling considering a job-splitting property
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- Matching with sizes (or scheduling with processing set restrictions)
- Matching with sizes (or scheduling with processing set restrictions)
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- Strategyproof mechanism for two-sided matching with resource allocation
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
- Scheduling unit length jobs on parallel machines with lookahead information
- The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost
- Revisiting the development trajectory of parallel machine scheduling
- Improved bounds for online scheduling with eligibility constraints
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
- Online parallel machines scheduling with two hierarchies
- Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- A note on graph balancing problems with restrictions
This page was built for publication: Parallel machine scheduling with job assignment restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5433529)
