1 / 12

Optimization of Job Scheduling in a Static Shop Environment

Find the optimal schedule and compute relevant performance metrics for job sequencing problems using various heuristic approaches.

katheryn
Download Presentation

Optimization of Job Scheduling in a Static Shop Environment

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Examples 23/10/2019

  2. Example 1 The followingtablecontains data pertainingto 1|| problem. Notethattherelease time rj=0 foralljobs. Hence, it is a staticshopenviroment. Findaverageflow time

  3. Example 2 Consider a singlemachinesequencing problem with data as shownbelow: Usefollowingsequencestofind makespan(Cmax), averagetardiness () andmaximumlateness (). • SPT sequence • EDD sequence

  4. Example 3 Consider 1|prec| problem with data given in thefollowingtable: Findthe optimal schedule.

  5. Example 4 Consider 1|| problem in whichthefollowing data is given: Findthe optimal scheduleandcomputeUj, Tmaxand.

  6. Example 5 The data pertainingto F3|| problem is shown in Tablebelow. • ApplyJohnson’sRuleandfindCmax • Apply CDS heuristicandfindCmax • Ifduedates of jobsare as follows:

  7. Example 5 • Ifduedates of jobsare as follows: Findthetardiness of jobsusingJohnson’sRuleand CDS heuristics. Which of themethodsprovides minimum value of Lmax?

  8. Example 6 The data pertainingto F3|| problem is shown in Tablebelow. Apply CDS heuristicandsolvethe problem.

  9. Example 7 The data pertainingto F3|| problem is shown in Tablebelow. Usethefollowingmethodstofindthebestsequence: • CDS heuristicapproach, • Nawaz, Enscore, and Ham (NEH) approach.

  10. Example 8 A company has a cellthat can producethreeparts:A, B, C. The time requiredtoproduceeachpart 25, 80, and 10 minutesforeachpartrespectively. Thevaluetoproducetheparts is 5 dollars, 20 dollars, and 1 dollarsrespectively. How wouldyouschedulethepartsthroughthecellto minimize thevalue of work in process?

  11. Example 9 • JaneReedbakesbreadsandcakes in her homeforpartiesotheraffairs on a contractbasis. Jane has onlyoneovenforbaking. OneparticularMondaymorningshefindsthatshe has agreedtocompletefivejobsforthatday. Her husband John willmakethedeliveries, whichrequireabout 15 minuteseach. Supposethatshebeginsbaking at 8.00 a.m.

  12. Example 9 • Determinethesequence in whichsheshouldperformthejobs in orderto minimize • Meanflow time • Maximum lateness • Number of tardyjobs

More Related