Results 31 to 40 of about 3,286,488 (309)

Approximation results for flow shop scheduling problems with machine availability constraints [PDF]

, 2009
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing ...
Strusevich, Vitaly A., Kubzin, Mikhail A., Potts, Chris N.   +2 more
core   +1 more source

Scheduling practice and recent developments in flow shop and job shop scheduling

, 2009
Each plant and/or service provider performs several tasks to satisfy customer demand. Every task consumes several resources in order to be completed. Scheduling deals with the allocation of limited resources to tasks over time. Because the resources used
Yenisey, Mehmet Mutlu
core   +1 more source

Fuzzy Distributed Hybrid Flow Shop Scheduling Problem With Heterogeneous Factory and Unrelated Parallel Machine: A Shuffled Frog Leaping Algorithm With Collaboration of Multiple Search Strategies

IEEE Access, 2020
The single factory production is shifting to multi-factory production which brings new challenges. Hybrid flow shop problem (HFSP) as a common problem in production-manufacturing has been studied extensively, however distributed hybrid flow shop problem (
Lei Wang, Dongdong Li
doaj   +1 more source

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen, Calogero Virgone, Antje Redlich, Michael Abele, Ricardo Lopez‐Almaraz, Tal Ben‐Ami, Ewa Bien, Gianni Bisogno, Maja Mazic Cesen, Andrea Ferrari, Malgorzata A. Krawczyk, Yves Reguerre, Dominik T. Schneider, Ines B. Brecht, Charlotte Rigaud, Bilgehan Yalcin, Rainer Claus, Christian Vokuhl, Constantin Lapa, Jörg Fuchs, Segolene Hescot, Thomas Walter, Julien Hadoux, Daniel Orbach   +23 more
wiley   +1 more source

Analysis of dispatching rules application on scheduling problem in flexible-flow shop production [PDF]

Tehnika, 2014
In this paper we analyzed a group of simple heuristic methods, which are used for solving the scheduling problem in manufacturing and services. The analysis was performed on the scheduling problem in a flexible-flow shop production, which is known by the
Rakićević Zoran M., Vujošević Mirko B.   +1 more
doaj   +1 more source

Application of genetic algorithm to industrial scheduling and problems of parameters evaluation

Lietuvos Matematikos Rinkinys, 2021
Genetic algorithms are widely used in various mathematical and real world problems. They are approximate metaheuristic algorithms, commonly used for solving NP-hard problems in combinatorial optimisation.
Edgaras Šakurovas, Narimantas Listopadskis   +1 more
doaj   +1 more source

Solid Pseudopapillary Neoplasm of the Pancreas in Children and Adolescents: Expert Recommendations

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Solid pseudopapillary neoplasm of the pancreas (SPN) is a rare low‐grade malignant exocrine pancreatic tumor, mostly discovered during the second decade of life in females, with a very good prognosis, provided microscopically complete surgical excision is achieved.
Sabine Irtan, Michael Abele, Calogero Virgone, Michaela Kuhlen, Ricardo Lopez‐Almarez, Tal Ben‐Ami, Ewa Bien, Maja Cesen, Malgorzata A. Krawczyk, Andrea Ferrari, Gianni Bisogno, Yves Reguerre, Dominik T. Schneider, Louise Galmiche, Jorg Fuchs, Sarah Braungart, Bilgehan Yalcin, Ines B. Brecht, Daniel Orbach   +18 more
wiley   +1 more source

Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems

IEEE Access, 2020
Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj   +1 more source

Ovarian Sex Cord Stromal Tumors in Children and Adolescents—The European Standard Clinical Practice Recommendations

Pediatric Blood &Cancer, EarlyView.
ABSTRACT As part of the European Cooperative Study Group for Paediatric Rare Tumours initiative, we developed standard clinical practice guidelines for ovarian sex cord stromal tumors, based on comprehensive national and international cohort analyses, literature review, and a final expert consensus conference.
Dominik T. Schneider, Kris‐Ann Schultz, Nora Schnitzler, Michael Abele, Tal Ben‐Ami, Ewa Bien, Gianni Bisogno, Ines B. Brecht, Maja Cesen, Andrea Ferrari, Michaela Kuhlen, Malgorzata A. Krawczyk, Ricardo Lopez‐Almaraz, Yves Reguerre, Calogero Virgone, Daniel Orbach   +15 more
wiley   +1 more source

A Note on Heuristics of Flow-Shop Scheduling [PDF]

Operations Research, 1996
We present an O(mn) two-group (TG) heuristic for the m-machine, n-job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of (m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.
openaire   +2 more sources