Pages that link to "Item:Q3518727"
From MaRDI portal
The following pages link to Scheduling parallel machines with inclusive processing set restrictions (Q3518727):
Displayed 23 items.
- Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
- Berth allocation with time-dependent physical limitations on vessels (Q421704) (← 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)
- 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)
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan (Q976111) (← 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 of a single crane in batch annealing process (Q1017463) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
- PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)