Browsing by Keywords "Heuristic methods"

Now showing items 21-40 of 47

    • Joint routing, gateway selection, scheduling and power management optimization in wireless mesh networks 

      Uzunlar Onur; Gökbayrak, Kağan; Yıldırım, E. A. (Institute of Industrial Engineers, 2012-05)
      The third generation (3G) wireless communications technology delivers user traffic in a single step to the wired network via base station; therefore it requires all base stations to be connected to the wired network. On ...

    • A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem 

      Dengiz, B.; Alabaş-Uslu, Ç.; Sabuncuoğlu, İhsan (IEEE, 2009)
      In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...

    • Match-up scheduling under a machine breakdown 

      Aktürk, M. S.; Görgülü, E. (Elsevier, 1999)
      When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to ...

    • Minimizing Lmax for the single machine scheduling problem with family set-ups 

      Schultz, S. R.; Hodgson, T. J.; King, R. E.; Taner, M. R. (Taylor & Francis, 2004)
      A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of ...

    • A multi-family dynamic lot sizing problem with coordinated replenishments: a heuristic procedure 

      Mercan, H. M.; Erenguc, S. S. (Taylor & Francis, 1993)
      Consider a manufacturing environment where multiple items are produced. These products are grouped into families due to their similarities in design and manufacturing. It pays off to coordinate the manufacture of products ...

    • A new dominance rule for the total weighted tardiness problem 

      Aktürk, M. S.; Yıldırım, M. B. (Taylor & Francis, 1999)
      We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ...

    • A new dominance rule to minimize total weighted tardiness with unequal release dates 

      Aktürk, M .S.; Özdemir, D. (Elsevier, 2001)
      We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...

    • New heuristic for the dynamic layout problem 

      Erel, E.; Ghosh, J. B.; Simon, J. T. (Palgrave Macmillan, 2003)
      The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ...

    • 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 ...

    • Non-identical parallel CNC machine scheduling 

      Türkcan, A.; Selim Aktürk, M.; Storer, R. H. (Taylor & Francis, 2003)
      In this study, we solve the non-identical parallel CNC machine scheduling problem. We have two objectives: minimizing the manufacturing cost (comprising machining, non-machining and tooling costs) and minimizing the total ...

    • A note on "continuous review perishable inventory systems: models and heuristics" 

      Gürler, Ü.; Özkaya, B. Y. (2003)
      In a recent paper, Lian and Liu (2001) consider a continuous review perishable inventory model with renewal arrivals, batch demands and zero lead times. However, the main analytical result they provide holds only for some ...

    • Parallel dedicated machine scheduling with a single server: full precedence case 

      Schultz, S. R.; Taner, Mehmet Rüştü (IIE, 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 ...

    • Plant Order Reduction for Controller Design 

      Özgüler, A. Bülent; Gündeş, A. N. (IEEE, 2003-06)
      Two dual methods of plant order reduction for controller design are proposed for linear, time-invariant, multi-input multi-output systems. The model reduction methods are tailored towards closed-loop stability and performance ...

    • Progression of color decision making in introductory design education 

      Ural, S. E.; Akbay, S.; Altay, B. (Wiley, 2017-04)
      Color comprises both subjective and objective aspects within its contextual nature. Research on color design tends to explore this seemingly contradictory concerns from theoretical point of view, as well as architectural ...

    • Regenerator placement and traffic engineering with restoration in GMPLS networks 

      Yetginer, E.; Karasan, E. (Springer, 2003)
      In this paper, we study regenerator placement and traffic engineering of restorable paths in generalized multiprotocol label switching (GMPLS) networks. Regenerators are necessary in optical networks in order to cope with ...

    • Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells 

      Batur, G. D.; Erol, S.; Karasan, O. E. (Elsevier, 2016)
      We focus on the scheduling problem arising in hybrid flexible flow shops which repeatedly produce a set of multiple part-types and where the transportation of the parts between the machines is performed by a robot. The ...

    • Robust controller design based on reduced order plants 

      Özgüler, A. B.; Gündeş, A. N. (Taylor & Francis, 2006)
      Two dual controller design methods are proposed for linear, time-invariant, multi-input multi-output systems, where designs based on a reduced order plant robustly stabilizer higher order plants with additional poles or ...

    • Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance 

      Aktürk, M. S.; Ghosh, J. B.; Güneş, E. D. (John Wiley & Sons, Inc., 2003)
      The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a ...

    • Sparse matrix decomposition with optimal load balancing 

      Pınar, Ali; Aykanat, Cevdet (IEEE, 1997-12)
      Optimal load balancing in sparse matrix decomposition without disturbing the row/column ordering is investigated. Both asymptotically and run-time efficient exact algorithms are proposed and implemented for one-dimensional ...

    • Spatial analysis of single allocation hub location problems 

      Peker, M.; Kara, B. Y.; Campbell, J. F.; Alumur, S. A. (Springer, 2016)
      Hubs are special facilities that serve as switching, transshipment and sorting nodes in many-to-many distribution systems. Flow is consolidated at hubs to exploit economies of scale and to reduce transportation costs between ...