Vai al contenuto principale della pagina

Algorithms for scheduling problems / / edited by Frank Werner, Larysa Burtseva, Yuri Sotskov



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Algorithms for scheduling problems / / edited by Frank Werner, Larysa Burtseva, Yuri Sotskov Visualizza cluster
Pubblicazione: Basel, Switzerland : , : MDPI, , 2018
Descrizione fisica: 1 online resource (208 pages) : illustrations
Disciplina: 670.427
Soggetto topico: Automated guided vehicle systems
Persona (resp. second.): WernerFrank
BurtsevaLarysa
SotskovYuri
Nota di contenuto: About the Special Issue Editors -- Preface to "Algorithms for Scheduling Problems" -- Hongliang Zhang, Youcai Fang, Ruilin Pan and Chuanming Ge A New Greedy Insertion Heuristic Algorithm with a Multi-Stage Filtering Mechanism for Energy-Efficient Single Machine Scheduling Problems Reprinted from: Algorithms 2018, 11, 18, doi: 10.3390/a11020018 -- Yuri N. Sotskov and Natalja G. Egorova Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective Reprinted from: Algorithms 2018, 11, 66, doi: 10.3390/a11050066 -- Nodari Vakhania Scheduling a Single Machine with Primary and Secondary Objectives Reprinted from: Algorithms 2018, 11, 80, doi: 10.3390/a11060080 -- Helio Yochihiro Fuchigami, Ruhul Sarker and Socorro Rangel Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling Reprinted from: Algorithms 2018, 11, 43, doi: 10.3390/a11040043 -- Victor Hugo Yaurima-Basaldua, Andrei Tchernykh, Francisco Villalobos-Rodríguez and Ricardo Salomon-Torres Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing Reprinted from: Algorithms 2018, 11, 68, doi: 10.3390/a11050068 -- Omid Gholami and Johanna Törnquist Krasemann A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time Reprinted from: Algorithms 2018, 11, 55, doi: 10.3390/a11040055 -- Alexander A. Lazarev, Ivan Nekrasov and Nikolay Pravdivets Evaluating Typical Algorithms of Combinatorial Optimization to Solve Continuous-Time Based Scheduling Problem Reprinted from: Algorithms 2018, 11, 50, doi: 10.3390/a11040050 -- D. G. Mogale, Geet Lahoti, Shashi Bhushan Jha, Manish Shukla, Narasimha Kamath and Manoj Kumar Tiwari Dual Market Facility Network Design under Bounded Rationality Reprinted from: Algorithms 2018, 11, 54, doi: 10.3390/a11040054 -- Boris Sokolov, Alexandre Dolgui and Dmitry Ivanov Optimal Control Algorithms and Their Analysis Manufacturing Systems for Short-Term Scheduling in Reprinted from: Algorithms 2018, 11, 57, doi: 10.3390/a11050057 -- Boris Kriheli and Eugene Levner Entropy-Based Algorithm for Supply-Chain Complexity Assessment Reprinted from: Algorithms 2018, 11, 35, doi: 10.3390/a11040035 -- Alexander Yu. Drozdov, Andrei Tchernykh, Sergey V. Novikov, Victor E. Vladislavlev and PHEFT: Pessimistic Image Processing Workflow Scheduling for DSP Clusters Raul Rivera-Rodriguez Reprinted from: Algorithms 2018, 11, 76, doi: 10.3390/a11050076.
Sommario/riassunto: This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more.
Titolo autorizzato: Algorithms for Scheduling Problems  Visualizza cluster
ISBN: 3-03897-120-0
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910688205303321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui