Results 21 to 30 of about 84,491 (259)

Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach [PDF]

, 2017
Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem.
Gerami, Ali, Jafarzadeh, Hassan, Moradinasab, Nazanin   +2 more
core   +4 more sources

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem [PDF]

, 2014
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding,
Ghomi, S.M.T. Fatemi, Jolai, F., Mirabi, Mohammad   +2 more
core   +1 more source

Flow shop scheduling with heterogeneous workers

European Journal of Operational Research, 2014
We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main
Alexander J. Benavides, Marcus Ritt, Cristóbal Miralles   +2 more
openaire   +4 more sources

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

The Complexity of Mean Flow Time Scheduling Problems with Release Times

, 2006
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time.
Baptiste, Philippe, Brucker, Peter, Chrobak, Marek, Durr, Christoph, Kravchenko, Svetlana A., Sourd, Francis   +5 more
core   +3 more sources

Health‐Related Quality of Life and Symptom Severity Among Patients With PIK3CA‐Related Overgrowth Spectrum: A Mixed‐Methods Study to Understand Real‐World Experience With Alpelisib Treatment

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu, Kaitlin LaGasse, Cory D. Saucier, Kimberly Raymond, Miranda Lauher‐Charest, Lauren Crowder, Beilei Cai, Mary Lisha Paul, Denise Adams   +8 more
wiley   +1 more source

New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria [PDF]

, 2013
In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized.
Bellenguez-Morineau, O., Lahlou, C., Prot, D.   +2 more
core   +5 more sources

The Dominance Flow Shop Scheduling Problem

Electronic Notes in Discrete Mathematics, 2018
Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Centro Cientifico Tecnologico Conicet - Bahia Blanca. Instituto de Matematica Bahia Blanca. Universidad Nacional del Sur. Departamento de Matematica.
Daniel Alejandro Rossit, Óscar C. Vásquez 0001, Fernando Tohmé, Mariano Frutos, Martín D. Safe   +4 more
openaire   +2 more sources

Serological Benefit of SARS‐CoV‐2 Vaccination Relative to Infection in Children With Acute Lymphoblastic Leukemia

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Children with acute lymphoblastic leukemia (ALL) are at risk of severe outcomes from SARS‐CoV‐2 (SCV2). In the post‐pandemic context, where most children have been infected with SCV2, there are limited data on whether vaccination remains beneficial in children with ALL.
Janna R. Shapiro, Freda Qi, Karen Colwill, Alina D. Dorogy, Ying Liu, Michelle Science, Anne‐Claude Gingras, James M. Rini, Sumit Gupta, Sarah Alexander, Shelly Bolotin, Tania H. Watts   +11 more
wiley   +1 more source

Selected heuristic algorithms for solving job shop and flow shop scheduling problems [PDF]

, 2014
Importance of job shop and flow shop scheduling has increased to a high extent. Nowadays, each and every industry focuses largely on how to schedule their machine working, since it is an important factor which decides the net productivity.
Das, M K
core