top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
A computer program for the generation of logic networks from task chart data / / Henry E. Herbert ; prepared for Langley Research Center
A computer program for the generation of logic networks from task chart data / / Henry E. Herbert ; prepared for Langley Research Center
Autore Herbert Henry E.
Pubbl/distr/stampa Washington, D.C. : , : National Aeronautics and Space Administration, Scientific and Technical Information Branch, , 1980
Descrizione fisica 1 online resource (iv, 34 pages) : illustrations
Collana NASA contractor report
Soggetto topico PERT (Network analysis)
Computer networks
Production scheduling - Computer programs
Network analysis (Planning) - Computer programs
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910704223103321
Herbert Henry E.  
Washington, D.C. : , : National Aeronautics and Space Administration, Scientific and Technical Information Branch, , 1980
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Metaheuristics for production scheduling [[electronic resource] /] / edited by Bassem Jarboui, Patrick Siarry, Jacques Teghem ; series editor, Jean-Paul Bourrières
Metaheuristics for production scheduling [[electronic resource] /] / edited by Bassem Jarboui, Patrick Siarry, Jacques Teghem ; series editor, Jean-Paul Bourrières
Pubbl/distr/stampa London, : ISTE
Descrizione fisica 1 online resource (529 p.)
Disciplina 670
Altri autori (Persone) JarbouiBassem
SiarryPatrick
TeghemJacques
BourrieresJean-Paul
Collana Automation-control and industrial engineering series
Soggetto topico Production scheduling - Data processing
Production scheduling - Computer programs
ISBN 1-118-73159-X
1-118-73156-5
1-118-73155-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Contents; Introduction and Presentation; Chapter 1. An Estimation of Distribution Algorithm for SolvingFlow Shop Scheduling Problems with Sequence-dependent FamilySetup Times; 1.1. Introduction; 1.2. Mathematical formulation; 1.3. Estimation of distribution algorithms; 1.3.1. Estimation of distribution algorithms proposed in the literature; 1.4. The proposed estimation of distribution algorithm; 1.4.1. Encoding scheme and initial population; 1.4.2. Selection; 1.4.3. Probability estimation; 1.5. Iterated local search algorithm; 1.6. Experimental results; 1.7. Conclusion
1.8. BibliographyChapter 2. Genetic Algorithms for Solving Flexible Job ShopScheduling Problems; 2.1. Introduction; 2.2. Flexible job shop scheduling problems; 2.3. Genetic algorithms for some related sub-problems; 2.4. Genetic algorithms for the flexible job shop problem; 2.4.1. Codings; 2.4.2. Mutation operators; 2.4.3. Crossover operators; 2.5. Comparison of codings; 2.6. Conclusion; 2.7. Bibliography; Chapter 3. A Hybrid GRASP-Differential Evolution Algorithmfor Solving Flow Shop Scheduling Problemswith No-Wait Constraints; 3.1. Introduction; 3.2. Overview of the literature
3.2.1. Single-solution metaheuristics3.2.2. Population-based metaheuristics; 3.2.3. Hybrid approaches; 3.3. Description of the problem; 3.4. GRASP; 3.5. Differential evolution; 3.6. Iterative local search; 3.7. Overview of the NEW-GRASP-DE algorithm; 3.7.1. Constructive phase; 3.7.2. Improvement phase; 3.8. Experimental results; 3.8.1. Experimental results for the Reeves and Heller instances; 3.8.2. Experimental results for the Taillard instances; 3.9. Conclusion; 3.10. Bibliography
Chapter 4. A Comparison of Local Search Metaheuristicsfor a Hierarchical Flow Shop Optimization Problemwith Time Lags4.1. Introduction; 4.2. Description of the problem; 4.2.1. Flowshop with time lags; 4.2.2. A bicriteria hierarchical flow shop problem; 4.3. The proposed metaheuristics; 4.3.1. A simulated annealing metaheuristics; 4.3.2. The GRASP metaheuristics; 4.4. Tests; 4.4.1. Generated instances; 4.4.2. Comparison of the results; 4.5. Conclusion; 4.6. Bibliography; Chapter 5. Neutrality in Flow Shop Scheduling Problems:Landscape Structure and Local Search; 5.1. Introduction
5.2. Neutrality in a combinatorial optimization problem5.2.1. Landscape in a combinatorial optimization problem; 5.2.2. Neutrality and landscape; 5.3. Study of neutrality in the flow shop problem; 5.3.1. Neutral degree; 5.3.2. Structure of the neutral landscape; 5.4. Local search exploiting neutrality to solve the flow shop problem; 5.4.1. Neutrality-based iterated local search; 5.4.2. NILS on the flow shop problem; 5.5. Conclusion; 5.6. Bibliography; Chapter 6. Evolutionary Metaheuristic Based on GeneticAlgorithm: Application to Hybrid Flow Shop Problemwith Availability Constraints
6.1. Introduction
Record Nr. UNINA-9910139244703321
London, : ISTE
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Metaheuristics for production scheduling [[electronic resource] /] / edited by Bassem Jarboui, Patrick Siarry, Jacques Teghem ; series editor, Jean-Paul Bourrières
Metaheuristics for production scheduling [[electronic resource] /] / edited by Bassem Jarboui, Patrick Siarry, Jacques Teghem ; series editor, Jean-Paul Bourrières
Edizione [1st ed.]
Pubbl/distr/stampa London, : ISTE
Descrizione fisica 1 online resource (529 p.)
Disciplina 670
Altri autori (Persone) JarbouiBassem
SiarryPatrick
TeghemJacques
BourrieresJean-Paul
Collana Automation-control and industrial engineering series
Soggetto topico Production scheduling - Data processing
Production scheduling - Computer programs
ISBN 1-118-73159-X
1-118-73156-5
1-118-73155-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Contents; Introduction and Presentation; Chapter 1. An Estimation of Distribution Algorithm for SolvingFlow Shop Scheduling Problems with Sequence-dependent FamilySetup Times; 1.1. Introduction; 1.2. Mathematical formulation; 1.3. Estimation of distribution algorithms; 1.3.1. Estimation of distribution algorithms proposed in the literature; 1.4. The proposed estimation of distribution algorithm; 1.4.1. Encoding scheme and initial population; 1.4.2. Selection; 1.4.3. Probability estimation; 1.5. Iterated local search algorithm; 1.6. Experimental results; 1.7. Conclusion
1.8. BibliographyChapter 2. Genetic Algorithms for Solving Flexible Job ShopScheduling Problems; 2.1. Introduction; 2.2. Flexible job shop scheduling problems; 2.3. Genetic algorithms for some related sub-problems; 2.4. Genetic algorithms for the flexible job shop problem; 2.4.1. Codings; 2.4.2. Mutation operators; 2.4.3. Crossover operators; 2.5. Comparison of codings; 2.6. Conclusion; 2.7. Bibliography; Chapter 3. A Hybrid GRASP-Differential Evolution Algorithmfor Solving Flow Shop Scheduling Problemswith No-Wait Constraints; 3.1. Introduction; 3.2. Overview of the literature
3.2.1. Single-solution metaheuristics3.2.2. Population-based metaheuristics; 3.2.3. Hybrid approaches; 3.3. Description of the problem; 3.4. GRASP; 3.5. Differential evolution; 3.6. Iterative local search; 3.7. Overview of the NEW-GRASP-DE algorithm; 3.7.1. Constructive phase; 3.7.2. Improvement phase; 3.8. Experimental results; 3.8.1. Experimental results for the Reeves and Heller instances; 3.8.2. Experimental results for the Taillard instances; 3.9. Conclusion; 3.10. Bibliography
Chapter 4. A Comparison of Local Search Metaheuristicsfor a Hierarchical Flow Shop Optimization Problemwith Time Lags4.1. Introduction; 4.2. Description of the problem; 4.2.1. Flowshop with time lags; 4.2.2. A bicriteria hierarchical flow shop problem; 4.3. The proposed metaheuristics; 4.3.1. A simulated annealing metaheuristics; 4.3.2. The GRASP metaheuristics; 4.4. Tests; 4.4.1. Generated instances; 4.4.2. Comparison of the results; 4.5. Conclusion; 4.6. Bibliography; Chapter 5. Neutrality in Flow Shop Scheduling Problems:Landscape Structure and Local Search; 5.1. Introduction
5.2. Neutrality in a combinatorial optimization problem5.2.1. Landscape in a combinatorial optimization problem; 5.2.2. Neutrality and landscape; 5.3. Study of neutrality in the flow shop problem; 5.3.1. Neutral degree; 5.3.2. Structure of the neutral landscape; 5.4. Local search exploiting neutrality to solve the flow shop problem; 5.4.1. Neutrality-based iterated local search; 5.4.2. NILS on the flow shop problem; 5.5. Conclusion; 5.6. Bibliography; Chapter 6. Evolutionary Metaheuristic Based on GeneticAlgorithm: Application to Hybrid Flow Shop Problemwith Availability Constraints
6.1. Introduction
Record Nr. UNINA-9910818726303321
London, : ISTE
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Oracle Primavera P6 : Version 8, 15 and 16 EPPM Web Administrators Guide / / Paul Eastwood Harris
Oracle Primavera P6 : Version 8, 15 and 16 EPPM Web Administrators Guide / / Paul Eastwood Harris
Autore Harris Paul Eastwood
Pubbl/distr/stampa Victoria, Australia : , : Eastwood Harris Pty Ltd, , 2016
Descrizione fisica 1 online resource (274 pages)
Disciplina 658.5
Soggetto topico Production planning - Computer programs
Production scheduling - Computer programs
Project management - Computer programs
ISBN 1-925185-46-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto INTRODUCTION REVIEW OF THE P6 WEB -- INTERFACE STARTING UP AND NAVIGATION PLANNING -- IMPLEMENTATION KEY MASTER DATA CONFIGURATION - EPS & WBS CALENDARSROLES AND RESOURCES CONFIGURING APPLICATION SETTINGS AND ENTERPRISE DATASECURITY & ACCESS -- CONFIGURATION USER CONFIGURED ITEMS OPERATIONAL -- SUPPORT REPORTING DATA IMPORT AND EXPORT TOOLSP6 -- IMPLEMENTATION PLAN TEMPLATE APPENDIX A - SAMPLE SECURITY PROFILESAPPENDIX B- ADDITIONAL IMPLEMENTATION RESOURCES INDEX.
Altri titoli varianti Oracle Primavera P6
Record Nr. UNINA-9910154889103321
Harris Paul Eastwood  
Victoria, Australia : , : Eastwood Harris Pty Ltd, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui