From manufacture to software development: a comparative review (2011)
- Authors:
- USP affiliated authors: LEJBMAN, ALFREDO GOLDMAN VEL - IME ; KATAYAMA, EDUARDO TERUO - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-20677-1_7
- Subjects: MÉTODOS ÁGEIS; DESENVOLVIMENTO DE SOFTWARE
- Keywords: lean software development; theory of constraints; comparative review; agile software development
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: International Conference on Agile Software Development - XP
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
KATAYAMA, Eduardo Teruo e GOLDMAN, Alfredo. From manufacture to software development: a comparative review. 2011, Anais.. Berlin: Springer, 2011. Disponível em: https://doi.org/10.1007/978-3-642-20677-1_7. Acesso em: 24 abr. 2024. -
APA
Katayama, E. T., & Goldman, A. (2011). From manufacture to software development: a comparative review. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-20677-1_7 -
NLM
Katayama ET, Goldman A. From manufacture to software development: a comparative review [Internet]. Proceedings. 2011 ;[citado 2024 abr. 24 ] Available from: https://doi.org/10.1007/978-3-642-20677-1_7 -
Vancouver
Katayama ET, Goldman A. From manufacture to software development: a comparative review [Internet]. Proceedings. 2011 ;[citado 2024 abr. 24 ] Available from: https://doi.org/10.1007/978-3-642-20677-1_7 - A contribuição da indústria da manufatura no desenvolvimento de software
- A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- Scheduling with duplication on m processors with small communication delays
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
- A model for parallel job scheduling on dynamic computer grids
- 1-optimality of static BSP computations: scheduling independent chains as a case study
Informações sobre o DOI: 10.1007/978-3-642-20677-1_7 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
