The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform
Ali Javey - One of the best experts on this subject based on the ideXlab platform.
-
iii vs at scale a pv Manufacturing Cost analysis of the thin film vapor liquid solid growth mode
Progress in Photovoltaics, 2016Co-Authors: Maxwell Zheng, Kelsey Horowitz, Michael Woodhouse, Corsin Battaglia, Rehan Kapadia, Ali JaveyAbstract:The authors present a Manufacturing Cost analysis for producing thin-film indium phosphide modules by combining a novel thin-film vapor–liquid–solid (TF-VLS) growth process with a standard monolithic module platform. The example cell structure is ITO/n-TiO2/p-InP/Mo. For a benchmark scenario of 12% efficient modules, the module Cost is estimated to be $0.66/W(DC) and the module Cost is calculated to be around $0.36/W(DC) at a long-term potential efficiency of 24%. The Manufacturing Cost for the TF-VLS growth portion is estimated to be ~$23/m 2 ,as ignificant reduction compared with traditional metalorganic chemical vapor deposition. The analysis here suggests the TF-VLS growth mode could enable lower-Cost, high-efficiency III-V photovoltaics compared with Manufacturing methods used today and open up possibilities for other optoelectronic applications as well. Copyright © 2016 John Wiley &S ons, Ltd.
K Zweibel - One of the best experts on this subject based on the ideXlab platform.
-
issues in thin film pv Manufacturing Cost reduction
Solar Energy Materials and Solar Cells, 1999Co-Authors: K ZweibelAbstract:Thin film PV technologies face a number of hurdles as they advance towards low-Cost goals that are competitive with traditional sources of electricity. The US Department of Energy Cost goal for thin films is about $0.33/Wp, which is based on a module efficiency goal of about 15% and module Manufacturing Costs of about $50/m2. This paper investigates the issues associated with achieving the $50/m2 goal based on opportunities for Manufacturing Cost reductions. Key areas such as capital Costs, deposition rates, layer thickness, materials Costs, yields, substrates, and front and back end Costs will be examined. Several prior studies support the potential of thin films to reach $50/m2. This paper will examine the necessary process research improvements needed in amorphous silicon, copper indium diselenide, cadmium telluride, and experimental thin film silicon PV technologies to reach this ambitious goal. One major conclusion is that materials Costs must be reduced because they will dominate in mature technologies. Another is that module efficiency could be the overriding parameter if different thin films each optimize their Manufacturing to a similar level.
Sinan Gürel - One of the best experts on this subject based on the ideXlab platform.
-
Rescheduling with controllable processing times for number of disrupted jobs and Manufacturing Cost objectives
International Journal of Production Research, 2014Co-Authors: Sinan Gürel, D. CincioğluAbstract:We consider a machine rescheduling problem that arises when a disruption such as machine breakdown occurs to a given schedule. Machine unavailability due to a breakdown requires repairing the schedule as the original schedule becomes infeasible. When repairing a disrupted schedule a desirable goal is to complete each disrupted job on time, i.e. not later than the planned completion time in the original schedule. We consider the case where processing times of jobs are controllable and compressing the processing time of a job requires extra processing Cost. Usually, there exists a nonlinear relation between the processing time and Manufacturing Cost. We solve a bicriteria rescheduling problem that trades off the number of on-time jobs and Manufacturing Cost objectives. We give a mixed-integer second-order cone programming formulation for the problem. We develop a heuristic search algorithm to generate efficient solutions for the problem. Heuristic algorithm searches solution space by moving and swapping job...
-
Parallel machine match-up scheduling with Manufacturing Cost considerations
Journal of Scheduling, 2009Co-Authors: M. Selim Akturk, Alper Atamtürk, Sinan GürelAbstract:Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the Manufacturing Cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain Manufacturing Cost, which is a convex function of the compression on the processing time. In rescheduling it is highly desirable to catch up the original schedule as soon as possible by reassigning the jobs to the machines and compressing their processing times. On the other hand, one must also keep the Manufacturing Cost due to compression of the jobs low. Thus, one is faced with a tradeoff between match-up time and Manufacturing Cost criteria. We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/Cost tradeoff. We employ the recent advances in conic mixed-integer programming to model these problems effectively. We further provide a fast heuristic algorithm driven by dual prices of convex subproblems for generating approximate efficient schedules.
-
Considering Manufacturing Cost and scheduling performance on a CNC turning machine
European Journal of Operational Research, 2007Co-Authors: Sinan Gürel, M. Selim AkturkAbstract:Abstract A well known industry application that allows controllable processing times is the Manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the Manufacturing Cost and its required processing time on a CNC turning machine. If we consider total Manufacturing Cost (F1) and total weighted completion time (F2) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencing decisions. We first give an effective model for the problem of minimizing F1 subject to a given F2 level. We deduce some optimality properties for this problem. Based on these properties, we propose a heuristic algorithm to generate an approximate set of efficient solutions. Our computational results indicate that the proposed algorithm performs better than the GAMS/MINOS commercial solver both in terms of solution quality and computational requirements such that the average CPU time is only 8% of the time required by the GAMS/MINOS.
Maxwell Zheng - One of the best experts on this subject based on the ideXlab platform.
-
iii vs at scale a pv Manufacturing Cost analysis of the thin film vapor liquid solid growth mode
Progress in Photovoltaics, 2016Co-Authors: Maxwell Zheng, Kelsey Horowitz, Michael Woodhouse, Corsin Battaglia, Rehan Kapadia, Ali JaveyAbstract:The authors present a Manufacturing Cost analysis for producing thin-film indium phosphide modules by combining a novel thin-film vapor–liquid–solid (TF-VLS) growth process with a standard monolithic module platform. The example cell structure is ITO/n-TiO2/p-InP/Mo. For a benchmark scenario of 12% efficient modules, the module Cost is estimated to be $0.66/W(DC) and the module Cost is calculated to be around $0.36/W(DC) at a long-term potential efficiency of 24%. The Manufacturing Cost for the TF-VLS growth portion is estimated to be ~$23/m 2 ,as ignificant reduction compared with traditional metalorganic chemical vapor deposition. The analysis here suggests the TF-VLS growth mode could enable lower-Cost, high-efficiency III-V photovoltaics compared with Manufacturing methods used today and open up possibilities for other optoelectronic applications as well. Copyright © 2016 John Wiley &S ons, Ltd.
M. Selim Akturk - One of the best experts on this subject based on the ideXlab platform.
-
Parallel machine match-up scheduling with Manufacturing Cost considerations
Journal of Scheduling, 2009Co-Authors: M. Selim Akturk, Alper Atamtürk, Sinan GürelAbstract:Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the Manufacturing Cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain Manufacturing Cost, which is a convex function of the compression on the processing time. In rescheduling it is highly desirable to catch up the original schedule as soon as possible by reassigning the jobs to the machines and compressing their processing times. On the other hand, one must also keep the Manufacturing Cost due to compression of the jobs low. Thus, one is faced with a tradeoff between match-up time and Manufacturing Cost criteria. We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/Cost tradeoff. We employ the recent advances in conic mixed-integer programming to model these problems effectively. We further provide a fast heuristic algorithm driven by dual prices of convex subproblems for generating approximate efficient schedules.
-
Considering Manufacturing Cost and scheduling performance on a CNC turning machine
European Journal of Operational Research, 2007Co-Authors: Sinan Gürel, M. Selim AkturkAbstract:Abstract A well known industry application that allows controllable processing times is the Manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the Manufacturing Cost and its required processing time on a CNC turning machine. If we consider total Manufacturing Cost (F1) and total weighted completion time (F2) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencing decisions. We first give an effective model for the problem of minimizing F1 subject to a given F2 level. We deduce some optimality properties for this problem. Based on these properties, we propose a heuristic algorithm to generate an approximate set of efficient solutions. Our computational results indicate that the proposed algorithm performs better than the GAMS/MINOS commercial solver both in terms of solution quality and computational requirements such that the average CPU time is only 8% of the time required by the GAMS/MINOS.
