Now showing items 1-3 of 3

    • 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 ...
    • Reactive scheduling in a dynamic and stochastic FMS environment 

      Sabuncuoğlu, İ.; Kızılışık, Ö. B. (Taylor & Francis, 2003)
      In this paper, we study the reactive scheduling problems in a dynamic and stochastic manufacturing environment. Specifically, we develop a simulationbased scheduling system for flexible manufacturing systems. We also propose ...
    • 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. ...