Now showing items 1-9 of 9

    • Customer order scheduling on a single machine with family setup times: complexity and algorithms 

      Erel, E.; Ghosh, J. B. (Elsevier, 2007)
      We consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring ...
    • Generating robust and stable schedules in a single machine environment 

      Goren, S.; Sabuncuoglu I. (2004)
      Scheduling is a decision making process that concerns with allocation of limited resources (machines, material handling equipment, operators, tools, etc.) to competing tasks (operations of jobs) over time with the goal of ...
    • Genetically encoded conductive protein nanofibers secreted by engineered cells 

      Kalyoncu, E.; Ahan, R. E.; Olmez, T. T.; Safak Seker, U. O. (Royal Society of Chemistry, 2017-06)
      Bacterial biofilms are promising tools for functional applications as bionanomaterials. They are synthesized by well-defined machinery, readily form fiber networks covering large areas, and can be engineered for different ...
    • An integrated process planning approach for CNC machine tools 

      Aktürk, M. S.; Avcı, S. (Springer-Verlag, 1996)
      In view of the high investment and tooling cost of a CNC machining centre, the cutting and idle times should be optimised by considering the tool consumption and the non-machining time cost components. In this paper, we ...
    • A neural network model for scheduling problems 

      Sabuncuoğlu, İ.; Gurgun, B. (Elsevier, 1996)
      Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum ...
    • New insights on the single machine total tardiness problem 

      Tansel, B. C.; Sabuncuoğlu, İ. (Palgrave Macmillan, 1997)
      Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...
    • Parallel dedicated machine scheduling with A single server: Full precedence case 

      Schultz, S.R.; Taner, M.R. (2004)
      The motivation for this study was the observation of a practical scenario that involves scheduling of two parallel machines attended by a single setup crew so as to minimize the makespan. This problem is known in scheduling ...
    • Scheduling to minimize the coefficient of variation 

      De, P.; Ghosh, J. B.; Wells, C. E. (Elsevier, 1996)
      In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...
    • Structural analysis of an InGaN/GaN based light emitting diode by X-ray diffraction 

      Öztürk, M. K.; Hongbo, Y.; SarIkavak, B.; Korçak, S.; Özçelik, S.; Özbay, Ekmel (Springer, 2009-04-18)
      The important structural characteristics of hexagonal GaN in an InGaN/GaN multi quantum well, which was aimed to make a light emitted diode and was grown by metalorganic chemical vapor deposition on c-plain sapphire, are ...