Parallel Processing and Applied Mathematics
From MaRDI portal
Publication:5307339
Recommendations
- Parallel Processing and Applied Mathematics
- Minimizing total load on parallel machines with linear deterioration
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Identical parallel machine scheduling with time-dependent processing times
Cited in
(12)- Parallel Processing and Applied Mathematics
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization
- Minimizing total load on parallel machines with linear deterioration
- Minimizing the sum of job completion times on capacitated parallel machines
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Equivalent time-dependent scheduling problems
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
- Identical parallel machine scheduling with time-dependent processing times
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
This page was built for publication: Parallel Processing and Applied Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307339)
