Pages that link to "Item:Q5456305"
From MaRDI portal
The following pages link to An approximation algorithm for parallel machine scheduling with simple linear deterioration (Q5456305):
Displaying 12 items.
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs (Q1388066) (← links)
- Identical parallel machine scheduling with time-dependent processing times (Q1704597) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098) (← links)
- A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times (Q5058834) (← links)
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
- A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs (Q5456312) (← links)
