• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A Generic Mechanism for Repairing Job Shop Schedules

Raheja, Amritpal Singh, Reddy, K. Rama Bhupal, Subramaniam, Velusamy 01 1900 (has links)
Reactive repair of a disrupted schedule is a better alternative to total rescheduling, as the latter is a time consuming process and also results in shop floor nervousness. The schedule repair heuristics reported in the literature generally address only machine breakdown. This paper presents a modified Affected Operations Rescheduling (mAOR) approach, which deals with many of the disruptions that are frequently encountered in a job shop. The repair of these disruptions has been decomposed into four generic repair actions that can be applied singularly or in combination. These generic repair actions are evaluated through a simulation study with the performance measures of efficiency and stability. The results indicate the effectiveness of the mAOR heuristic in dealing with typical job shop disruptions. / Singapore-MIT Alliance (SMA)
2

Reactive Schedule Repair of Job Shops

Raheja, Amritpal Singh, Subramaniam, Velusamy 01 1900 (has links)
Disruptions to job shop schedules are tedious and difficult to incorporate after the schedule has been generated and implemented on the shop floor. In order to deal with such disruptions, a real time reactive scheduling strategy is essential. Reactive scheduling is the process of repairing the predictive schedule during online execution for internal disruptions (e.g. machine breakdowns) and external deviations (e.g. prepone or postpone of orders). Existing approaches for schedule repair in real time mainly utilize heuristics such as Right Shift Rescheduling (RSR), and Affected Operation Rescheduling (AOR). In the present form, both these approaches are only used for handling machine breakdowns in the shop floor, but are inept in accommodating new and unexpected job orders. These approaches also neglect specific issues related to urgent jobs, for instance multiple job routings during the repair of the schedule. In this paper the existing heuristics (RSR and AOR) have been modified to include urgent jobs. Also a modified AOR approach (mAOR) is proposed that considers urgent jobs with multiple job routings. An extensive simulation study has been conducted on a job shop simulation testbed for the efficiency and stability of the repaired schedule using the mAOR and RSR heuristics. The efficiency of the repaired schedule is a measure of the percentage change in the makespan after incorporating repairs whereas the stability of the schedule is a function of starting time deviations that indicate the degree by which it deviates from the original schedule. The results of the experiments indicate significant benefits of the modified AOR algorithm over the existing RSR schedule repair heuristic. / Singapore-MIT Alliance (SMA)

Page generated in 0.0405 seconds