Now showing items 1-9 of 9

    • Assembly line balancing using genetic algorithms 

      Sabuncuoğlu İ.; Erel, E.; Tanyer, M. (Kluwer Academic Publishers, 2000)
      Assembly Line Balancing (ALB) is one of the important problems of production/operations management area. As small improvements in the performance of the system can lead to significant monetary consequences, it is of utmost ...
    • Batch scheduling to minimize the weighted number of tardy jobs 

      Erel, E.; Ghosh, J. B. (Pergamon Press, 2007)
      In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ...
    • An efficient algorithm for the single machine total tardiness problem 

      Tansel, B. Ç.; Kara, B. Y.; Sabuncuoğlu İ. (Taylor & Francis, 2001)
      This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job ...
    • An exact approach to minimizing total weighted tardiness with release dates 

      Aktürk, M. S.; Özdemir, D. (Kluwer Academic Publishers, 2000)
      The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound ...
    • Microfluidics for reconfigurable electromagnetic metamaterials 

      Kasirga, T. S.; Ertas, Y. N.; Bayindir, M. (AIP Publishing, 2009)
      We propose microfluidics as a useful platform for reconfigurable electromagnetic metamaterials. Microfluidic split-ring resonators (MF-SRRs) are fabricated inside a flexible elastomeric material by employing rapid prototyping. ...
    • A problem space algorithm for single machine weighted tardiness problems 

      Avcı, S.; Aktürk, M. S.; Storer, R. H. (Taylor & Francis Inc., 2003)
      We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...
    • Satisfying due-dates in a job shop with sequence-dependent family set-ups 

      Taner, M. R.; Hodgson, T. J.; King, R. E.; Thoney, K. A. (Taylor & Francis, 2003)
      This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed ...
    • Single machine earliness-tardiness scheduling problems using the equal-slack rule 

      Oğuz, C.; Dincer, C. (Palgrave Macmillan Ltd., 1994)
      The purpose of this paper is to analyze a special case of the non-pre-emptive single machine scheduling problem where the distinct due dates for each job are related to processing times according to the Equal-Slack rule. ...
    • Tactical capacity management under capacity flexibility 

      Alp, O.; Tan, T. (Taylor & Francis, 2008)
      In many production systems a certain level of flexibility in the production capacity is either inherent or can be acquired. In that case, system costs may be decreased by managing the capacity and inventory in a joint ...