Pages that link to "Item:Q2503099"
From MaRDI portal
The following pages link to Scheduling unit-length jobs with machine eligibility restrictions (Q2503099):
Displaying 19 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Parallel machine scheduling of machine-dependent jobs with unit-length. (Q1426708) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- The ``least flexible job first'' rule in scheduling and in queueing (Q2450742) (← links)
- Scheduling unit length jobs with parallel nested machine processing set restrictions (Q2566928) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) (← links)
- Faster algorithms for semi-matching problems (Q2799478) (← links)
- (Q3402864) (← links)
- (Q4448359) (← links)
- Parallel machine scheduling with machine and human eligibility restrictions (Q5197284) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
