Pages that link to "Item:Q868990"
From MaRDI portal
The following pages link to Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990):
Displaying 6 items.
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- The battery switching station scheduling problem (Q1939710) (← links)
- A branch and bound algorithm for optimal television commercial scheduling (Q2086864) (← links)
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)