Search Constraints

Start Over
Filtering by: Creator Gupta, M. Remove constraint Creator: Gupta, M. Advisor Logendran, Rasaratnam Remove constraint Advisor: Logendran, Rasaratnam

Search Results

  • Multi-stage group scheduling problems with sequence dependent setups

    Creator:
    Salmasi, Nasser
    Abstract:
    The challenges faced by manufacturing companies have forced them to become more efficient. Cellular manufacturing is a concept that has been accepted as a technique for increasing manufacturing productivity in batch type production by efficient grouping of parts (jobs) with some similarities in processing operations into groups and sequentially matching...
    Resource Type:
    Dissertation
    Full Text:
    . In this research, it is assumed that n groups are assigned to a cell that has m machines. Each group

  • Bi-Criteria Batching and Scheduling in Hybrid Flow Shops

    Creator:
    Shahvari, Omid
    Abstract:
    In this research, a bi-criteria batching and scheduling problem is investigated in hybrid flow shop environments, where unrelated-parallel machines are run simultaneously with different capacities and eligibilities in processing, in some stages. The objective is to simultaneously minimize a linear combination of the total weighted completion time and total weighted...
    Resource Type:
    Dissertation

  • Bi-Criteria Batching and Scheduling in Hybrid Flow Shops

    Creator:
    Shahvari, Omid
    Abstract:
    In this research, a bi-criteria batching and scheduling problem is investigated in hybrid flow shop environments, where unrelated-parallel machines are run simultaneously with different capacities and eligibilities in processing, in some stages. The objective is to simultaneously minimize a linear combination of the total weighted completion time and total weighted...
    Resource Type:
    Dissertation

  • Bi-criteria group scheduling with learning in hybrid flow shops

    Creator:
    Bozorgirad, Mir Abbas
    Abstract:
    In this research, a bi-criteria group scheduling problem is investigated in hybrid flow shop (HFS) environments, where the parallel machines in each stage are unrelated, meaning not identical. The objective of the problem is to minimize a linear combination of the total weighted completion times as a means of complying...
    Resource Type:
    Dissertation
    Full Text:
    ; Gupta, Hariri, & Potts, 1997; Haouari, Hidri, & Gharbi, 2006). Although exact algorithms such as B&B

  • Group scheduling in electronics manufacturing with integration of internal and external setup times

    Creator:
    Yazdani Sabouni, Mohammad Taghi
    Abstract:
    This research considers a combinatorial optimization scheduling problem in the assembly of printed circuit boards (PCBs) in electronic manufacturing. For the first time in this research, the preparation process, which is typically called kitting operation, is paid attention to and is performed along with the assembly operation, described in this...
    Resource Type:
    Dissertation
    Full Text:
    Representation   d co re v fl m d p d sh sc en d m F S ecreased ma osts can be equirement

  • Two-stage flexible flow shop scheduling with blocking constraint and batching machines

    Creator:
    Panahi, Hadi
    Abstract:
    In this dissertation, a two stage flexible flow shop scheduling problem is studied, where in stage 1, there are identical batch processors (burnout ovens) and in stage 2, there are identical discrete processors (furnaces). Batch processors perform a pre-heating process on a batch of jobs at a time and discrete...
    Resource Type:
    Dissertation
    Full Text:
    algorithms for the hybrid flow shop scheduling problem are proposed by Gupta et al. (2002). They assumed

  • Quantifying product development efforts : a methodology

    Creator:
    Boer, Michael R.
    Abstract:
    Product development efforts are extremely important to a company's success in today's global competitive business environment. Yet, these highly consequential efforts are terribly nebulous to a point that past experiences are inherently underutilized. This thesis demonstrates a methodology to quantify past product development efforts in an attempt to better utilize...
    Resource Type:
    Masters Thesis

  • Group-scheduling problems in electronics manufacturing

    Creator:
    Geloğullari, Cumhur Alper
    Abstract:
    This dissertation addresses the "multi-machine carryover sequence dependent group-scheduling problem with anticipatory setups," which arises in the printed circuit board (PCB) manufacturing. Typically, in PCB manufacturing different board types requiring similar components are grouped together to reduce setup times and increase throughput. The challenge is to determine the sequence of...
    Resource Type:
    Dissertation
    Full Text:
    minimizing the maximum tardiness. Gupta and Ho [55] consider the problem of minimizing the number of tardy

  • Bi-criteria group scheduling with sequence-dependent setup time in a flow shop

    Creator:
    Lu, Dongchen
    Abstract:
    Cellular manufacturing, which is also referred to as group technology among researchers, has primarily been used as a means to increase productivity, efficiency and flexibility. Under group technology, similar jobs, which have similar shape, material, and processing operations are assigned to the same group. Moreover, dissimilar machines are assigned to...
    Resource Type:
    Masters Thesis
    Full Text:
    . (1970) studied an n-job m-machine sequencing problem. A simple heuristic algorithm was developed to

  • Bi-criteria Scheduling in an Assembly Flow Shop with Limited Buffer Storage and Shift Production

    Creator:
    Aryal, Ayush R.
    Abstract:
    In this research, the comparative performance of permutation and non-permutation schedules is investigated in an assembly flow shop (AFS) with shift production, where a limited buffer storage is available between two machines. Most of the traditional scheduling problems consider continuous production, i.e., production occurs for 24 hours (3 * 8-hour...
    Resource Type:
    Masters Thesis
    Full Text:
    Smith (CDS) (1970) for the m-machine problem. CDS algorithm transforms m machines into (m-1) two