Parallel Processing and Applied Mathematics
From MaRDI portal
Publication:5307339
DOI10.1007/B97218zbMATH Open1128.68333OpenAlexW2984027331MaRDI QIDQ5307339FDOQ5307339
Authors: Stanisław Gawiejnowicz, Wiesław Kurc, Lidia Pankowska 
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97218
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-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
- Parallel Processing and Applied Mathematics
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)
