Pages that link to "Item:Q2655610"
From MaRDI portal
The following pages link to Parallel machine scheduling with nested processing set restrictions (Q2655610):
Displaying 15 items.
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← 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 note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← 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)
- Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← 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 in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
