Results 101 to 110 of about 1,874,071 (376)
Particle swarm optimization applied to job shop scheduling [PDF]
, 2007 In this project we have to apply the particle swarm optimization algorithm to job shop scheduling problem. Job shop scheduling is a combinatorial optimization problem where we have to arrange the jobs which may or may not be processed in every machine in
Dwivedi , Piyush, Vishal , Vivek
core
Automated rapidplan model validation using Eclipse scripting API
Journal of Applied Clinical Medical Physics, EarlyView.Abstract RapidPlan offers efficiency gains and quality improvements in treatment planning. Prior to its use in the clinic, it requires an extensive validation procedure in which established clinical plans and those generated by the model are compared. The manual iterative nature of this process is resource intensive, as numerous iterations are required
Bradley Beeksma +2 more
wiley +1 more source
ESTIMATION OF JOB COMPLETION TIMES IN A DYNAMIC SHOP JOB BASED ON STATIC JOB SHOP SOLUTION
IFAC Proceedings Volumes, 2007 Abstract We investigate the temporal behaviour of completion time estimates derived from scheduling algorithms that are based on the set of already known and accepted orders (static job shop problem). In a dynamic job shop environment, these estimates change over time, typically increasing.
Tobias Roithner, Christoph Heitz
openaire +2 more sources
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This study aims to develop a CycleGAN based denoising model to enhance the quality of low‐dose PET (LDPET) images, making them as close as possible to standard‐dose PET (SDPET) images. Methods Using a Philips Vereos PET/CT system, whole‐body PET images of fluorine‐18 fluorodeoxyglucose (18F‐FDG) were acquired from 37 patients to ...
Yang Liu, ZhiWu Sun, HaoJia Liu
wiley +1 more source
Flexible job shop scheduling problem in manufacturing [PDF]
, 2013 This paper addresses a real assembly cell: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-Cambrésis, in France. This system can be viewed as a Flexible Job Shop, leading to the formulation of a Flexible Job Shop Scheduling Problem (
Barbosa, José +3 more
core
Analysis of usage of genetic and tabu search algorithms in shop scheduling
Lietuvos Matematikos Rinkinys, 2008 A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems.
Edgaras Šakurovas +1 more
doaj +1 more source
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose The aim of this work was to report on the optimization, commissioning, and validation of a beam model using a commercial independent dose verification software RadCalc version 7.2 (Lifeline Software Inc, Tyler, TX, USA), along with 4 years of experience employing RadCalc for offline and online monitor unit (MU) verification on the ...
Urszula Jelen +3 more
wiley +1 more source
IEEE Internet of Things Journal, 2019 With the rapid advancement and widespread applications of information technology in the manufacturing shop floor, a huge amount of real-time data is generated, providing a good opportunity to effectively respond to unpredictable exceptions so that the ...
Jin Wang +3 more
semanticscholar +1 more source
Radiotherapy medical physics in the Philippines: A contemporary overview
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose With cancer ranking as the third leading cause of death in the Philippines and a disparity in healthcare resources across regions, this research aimed to assess the state of radiotherapy medical physics in the country. Methodology The study utilized a comprehensive online survey with 94 structured questions answered by 19 clinics ...
John Paul C. Cabahug +4 more
wiley +1 more source
Applying Machine Based Decomposition in 2-Machine Flow Shops [PDF]
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved ...
Chatterjee Ashis K, Mukherjee, Saral
core