Parallel machine scheduling with nested job assignment restrictions
From MaRDI portal
Cites work
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for scheduling on parallel machines
- scientific article; zbMATH DE number 5764783 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with job assignment restrictions
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling unit length jobs with parallel nested machine processing set restrictions
Cited in
(22)- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Restricted assignment scheduling with resource constraints
- Parallel machine scheduling with nested processing set restrictions and job delivery times
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- Scheduling jobs with release and delivery times subject to nested eligibility constraints
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- Online scheduling with equal processing times and machine eligibility constraints
- Parallel machine scheduling with restricted job rejection
- Parallel batch scheduling with nested processing set restrictions
- On some special cases of the restricted assignment problem
- Parallel machine scheduling with nested processing set restrictions
- Fast approximation algorithms for job scheduling with processing set restrictions
- Multiple subset sum with inclusive assignment set restrictions
- Matching with sizes (or scheduling with processing set restrictions)
- Matching with sizes (or scheduling with processing set restrictions)
- Makespan minimization in online scheduling with machine eligibility
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
- Makespan minimization in online scheduling with machine eligibility
- Vertex ordering with precedence constraints
- (In-)approximability results for interval, resource restricted, and low rank scheduling
- Improved bounds for online scheduling with eligibility constraints
- Two results on LPT: a near-linear time algorithm and parcel delivery using drones
This page was built for publication: Parallel machine scheduling with nested job assignment restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270323)
