CHAPTER 16: SCHEDULING
|
|
- Todd Goodwin
- 6 years ago
- Views:
Transcription
1 CHAPTER 16: SCHEDULING Solutions: 1. Job A B C A B C row Worker reduction column reduction A B C Optimum: Worker 1, Job A B 3 C 2. Initial Job Initial revised A B C A B C A B C row Worker reduction column reduction A B C Optimum: B, 2 C, 3 A
2 3. Route A B C D E A B C D E Truck row reduction column reduction A B C D E A B C D E add and subtract Optimum: 1 A, 2 E, 3 D, 4 B, 5 C or 1 A, 2 D, 3 E, 4 B, 5 C 16-2
3 4. Job Job Initial + Dummy Machine A B C D row [no change due to dummy] reduction column reduction A B C D A B C D add and subtract Optimum: 1 B, 2 C, 3 D, 4 A Total cost = $ a. Initial revised Machine A B C D E A B C D E Job row reduction column reduction A B C D E Optimum: 1 A, 2 B, 3 C, 4 D, 5 E
4 5. b. Initial revised Machine A B C D E A B C D E Job row reduction column reduction A B C D E A B C D E add and subtract Optimum: 1 E, 2 B, 3 C, 4 D, 5 A 16-4
5 6. a. FCFS: A B C D SPT: D C B A EDD: C B D A CR: A C D B FCFS: Job time Flow time Due date Days Job (days) (days) (days) tardy A B C D SPT: Job time Flow time Due date Days Job (days) (days) (days) tardy D C B A EDD: Job time Flow time Due date Days Job (days) (days) (days) tardy C Critical Ratio B D A Processing Time Job (Days) Due Date Critical Ratio Calculation A (20 0) / 14 = 1.43 B (16 0) /10 = 1.60 C 7 15 (15 0) / 7 = 2.14 D 6 17 (17 0) / 6 = 2.83 Job A has the lowest critical ratio, therefore it is scheduled first and completed on day 14. After the completion of Job A, the revised critical ratios are: 16-5
6 Processing Time Job (Days) Due Date Critical Ratio Calculation A B (16 14) /10 = 0.20 C 7 15 (15 14) / 7 = 0.14 D 6 17 (17 14) / 6 = 0.50 Job C has the lowest critical ratio, therefore it is scheduled next and completed on day 21. After the completion of Job C, the revised critical ratios are: Processing Time Job (Days) Due Date Critical Ratio Calculation A B (16 21) /10 = 0.50 C D 6 17 (17 21) / 6 = 0.67 Job D has the lowest critical ratio therefore it is scheduled next and completed on day 27. The critical ratio sequence is A C D B and the makespan is 37 days. Critical Ratio sequence Processing Time (Days) Flow time Due Date Tardiness A C D B
7 41 99 Average Tardiness day s; Average flow time 24.75days 4 4 b. 99 Average number of jobs 2.67 jobs 37 Flow time Average flow time Numberof jobs FCFS SPT EDD CR Average job tardiness Day stardy Numberof jobs Average number of c. SPT is superior. jobs at thecenter Flow time job times
8 7. FCFS: a b c d e SPT: c b a e d EDD: a b c e d CR: a e b c d FCFS: Operation Flow time Due date Hours Job time (hr.) (hr.) (hr.) tardy a b c d e SPT: Operation Flow time Due date Hours Job time (hr.) (hr.) (hr.) tardy c b a e d EDD: Operation Flow time Due date Hours Job time (hr.) (hr.) (hr.) tardy a b c e d
9 Critical Ratio Job Processing Time (Hours) Due Date Critical Ratio Calculation A (.14 x 45) +.7 = 7 4 (4 0) / 7 =.57 B (.25 x 14) +.5 = 4 10 (10 0) / 4 = 2.5 C (.10 x 18) +.2 = 2 12 (12 0) / 2 = 6 D (.25 x 40) + 1 = (20 0) / 11 = 1.82 E (.10 x 75) +.5 = 8 15 (15 0) / 8 = 1.88 Job A has the lowest critical ratio, therefore it is scheduled first and completed after 4 hours, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B 4 10 (10 4) / 4 = 1.5 C 2 12 (12 4) / 2 = 4 D (20 4) / 11 = 1.45 E 8 15 (15 4) / 8 = 1.38 Job B has the lowest critical ratio therefore it is scheduled next and it is completed after 11 hours (7 + 4). After the completion of Job B, the revised critical ratios are: Processing Time Job (Hours) Due Date Critical Ratio Calculation A B C 2 12 (12 11) / 2 = 0.5 D (20 11) / 11 =.81 E 8 15 (15 11) / 8 =.5 Job C and Job E are tied for the lowest critical ratio and Job C is arbitrarily selected and is scheduled next. Job C is completed in 2 hours bringing the total completion time to = 13. After the completion of Job C, the revised critical ratios are: 16-9
10 Processing Time Job (Hours) Due Date Critical Ratio Calculation A B C D (20 13) / 11 =.63 E 8 15 (15 13) / 8 =.25 Job E has the lowest critical ratio therefore it is scheduled next. The critical ratio final sequence is A B C E D. Total completion of all six jobs (makespan) is 32 hours. Critical Ratio Processing sequence Time (Days) Flow time Due Date Tardiness A B C E D Average tardiness ; Average flow time 84 Average number of jobs 2.63 jobs hours 5 Average flow time Average job tardiness Flow time Numberof jobs Hours late Numberof jobs FCFS SPT EDD CR Average number of jobs at thecenter Flow time job times
11 8. a. (1) FCFS: A B C D E (2) S/O: B D C A E OR D B C A E [see below] Time Due date Remaining number Job (days) (days) Slack of operations Ratio Rank A B ,2 (tie) C D ,2 (tie) E b. S/O: [Assume B D C A E] Time Flow time Due date Days Job (days) (days) (days) tardy B D C A E Time Flow time Due date Days Job (days) (days) (days) tardy A B C D E flow time: Average flow time = number of jobs flow time: Average number of jobs in the system = job times FCFS S/O
12 9. Time (hr.) Order Step 1 Step 2 A B C D E F G Sequence of assignment:.80 [C] last (i.e., 7th).90 [B] first 1.20 [A] 2nd 1.30 [G] 3rd 1.60 [E] 4th 1.50 [D] 6th 1.75 [F] 5th Thus, the sequence is b-a-g-e-f-d-c. 10. a. Job Machine A Machine B a b Thus, the sequence is e b g h d c a f. c d e f g h b
13 e B g h d c a f e b g h d c a f c. Original idle time for B: = 18 hrs., and original makespan is 92. The last two tasks in the sequence are a and f. Splitting both of their completion times evenly, we get the following results. Machine 1 Machine 2 a a f f After splitting, we get the following Gantt chart: e b g h d c a 1 a 2 f 1 f 2 e b g h d c a 1 a 2 f 1 f After splitting, idle time is: = 16 hours, and the new makespan = 90. There is a savings of 2 hr. Time (minutes) 11. a. Job Center 1 Center 2 A B Thus, the sequence is B A C E F D. C D E F b B A C E F D B A C E F D
14 Idle time of 56 hours. 12. a. Job Station A Station B a b Thus, the sequence is b a c d e. c d e b a c d e b a c d e b. The Idle time for Station B is = = 37 minutes. c. Jobs B, A, C, D and E are candidates for splitting in order to reduce throughput time and idle time B 18 A 27 C 70 D 26 E 15 B 33 A 45 C 30 D 24 E Throughput time is 162 minutes, reducing this time by 17 minutes. The idle time for B of 20 minutes has decreased by 17 minutes
15 13. Determine job times from the schedule table, and then use Johnson s Rule to sequence the jobs. The job times are: Job A B C D E F G Cutting Polishing Using Johnson s Rule, we obtain: Cutting Polishing Job Start Finish Start Finish G A E D B C F Note: The order of Jobs A and E can be reversed with no effect on times. 14. a.,b. SPT Grinding Deburring Job Start Finish Start Finish C B A D G F E The Grinding flow time is 93 hours and Deburring flow time is 140 hours. The Total time is 37 hours
16 c. Johnson s Rule Grinding Deburring Job Start Finish Start Finish C B A F E D G The Grinding flow time is 107 hours and Deburring flow time is 140 hours. The Total time is 35 hours. d. The tradeoff is between shorter flow time in the Grinding and Deburring departments and shorter total processing time. Ed would be indifferent if the benefit to be gained by shorter total processing time was equal to the cost of additional flow time in the Grinding and Deburring departments. 15. a. FCFS: SPT: Job Flow Due Days Job Flow Due Days Job time time date tardy Job time time date tardy a d b e c f d a e c f b EDD: CR: Job Flow Due Days Job Flow Due Days Job time time date tardy Job time time date tardy a a c c b b e e f f d d
17 Critical Ratio Processing Time Job (Days) Due Date Critical Ratio Calculation A (10 0) / 4.5 = 2.22 B (17 0) / 6.0 = 2.83 C (12 0) / 5.2 = 2.31 D (27 0) / 1.6 = E (18 0) / 2.8 = 6.43 F (19 0) / 3.3 = 5.76 Job A has the lowest critical ratio, therefore it is scheduled first and completed after 4.5 days. The revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B (17 4.5) / 6.0 = 2.08 C (12 4.5) / 5.2 = 1.44 D (27 4.5) / 1.6 = E (18 4.5) / 2.8 = 4.82 F (19 4.5) / 3.3 = 4.39 Job C has the lowest critical ratio, therefore it is scheduled next and it is completed after 9.7 days ( ). After the completion of Job C, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B (17 9.7) / 6.0 = 1.22 C D (27 9.7) / 1.6 = E (18 9.7) / 2.8 = 2.96 F (19 9.7) / 3.3 =
18 Job B has the lowest critical ratio, therefore it is scheduled next and it is completed after 15.7 days ( ). After the completion of Job B, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B C D ( ) / 1.6 = 7.06 E ( ) / 2.8 = 0.82 F ( ) / 3.3 = 1.0 Job E has the lowest critical ratio, therefore it is scheduled next and it is completed after 18.5 days ( ). After the completion of Job E, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B C D ( ) / 1.6 = 5.31 E F ( ) / 3.3 = 0.15 Job F has the lowest critical ratio therefore it is scheduled next and it is completed after 21.8 days ( ). The final critical ratio sequence is A C B E F D. Total completion of all six jobs (makespan) is 23.4 days. Critical Ratio sequence Processing Time (Days) Flow time Due Date Lateness Tardiness A C B E F D
19 Rule Average days late Average flow flow time Average flow time = = = tardiness no. of jobs time no. of jobs no. of jobs job time FCFS 10.2/6 = 1.7 days 91.5/6 = days 91.5/23.4 = 3.91 jobs SPT 14.0/6 = 2.33 days 66.7/6 = days 66.7/23.4 = 2.85 EDD 3.3/6 = 0.55 days. 93.6/6 = days 93.6/23.4 = 4.00 CR 3.3/6 =.55 days 93.6/6 = days 93.6/23.4 = 4.00 b. There are several ways to show this. One is to calculate the ratio of average flow time to average number of jobs for each rule and then observe that they are equal. Here the ratios are approximately [Slight differences in ratios may arise due to rounding.] c. S/O job sequence is a-c-b-e-d-f 16. Job Remaining processing time Due date Slack Remaining number of operations Slack Remaining number of operations Rank a b c d e Using the S/O rule, the sequence is B C E A D 17. FCFS Job time Due date Flow time Tardy Job (hr.) (hr.) (hr.) (hr.) a b c d e f
20 SPT Job Job time Flow time Due date Tardy b e a c d f EDD Job Job time Flow time Due date Tardy e b a c f d Critical Ratio Processing Time Job (Days) Due Date Critical Ratio Calculation A (7 0) / 3.5 = 2.0 B (6 0) / 2.0 = 3.0 C (18 0) / 4.5 = 4.0 D (22 0) / 5.0 = 4.4 E (4 0) / 2.5 = 1.6 F (20 0) / 6 =
21 Job E has the lowest critical ratio, therefore it is scheduled first and completed after 2.5 hours. The revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A (7 2.5) / 3.5 = 1.29 B (6 2.5) / 2.0 = 1.75 C (18 2.5) / 4.5 = 3.44 D (22 2.5) / 5.0 = 3.90 E F (20 2.5) / 6 = 2.92 Job A is scheduled next because Job A has the lowest critical ratio. Job A will be completed after 6 hours ( ). After the completion of Job A, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B (6 6) / 2.0 = 0 C (18 6) / 4.5 = 2.67 D (22 6) / 5.0 = 3.20 E F (20 6) / 6 = 2.33 Since Job B has the lowest critical ratio, it is scheduled next and it is completed after 8 hours (6 + 2). After the completion of Job B, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B C (18 8) / 4.5 = 2.22 D (22 8) / 5.0 = 2.80 E F (20 8) / 6 =
22 Since Job F has the lowest critical ratio, it is scheduled next and it will be completed after 14 hours (8 + 6). After the completion of Job F, the revised critical ratios are: Processing Job Time (Hrs.) Due Date Critical Ratio Calculation A B C (18 14) / 4.5 = 0.89 D (22 14) / 5.0 = 1.60 E F Since Job C has the lowest critical ratio, it is scheduled next. Job C will be completed after 18.5 hours. The final critical ratio sequence of all jobs is E A B F C D. Total completion of all six jobs (makespan) is 23.5 hours. Critical Job Flow Due Job ratio time time date Tardy e a b f c d Averageflow time Averagetardiness.67hours hours FCFS SPT EDD CR Average flow time Average job tardiness
23 18. a. Order Job time A 16 x 4 = 64 B 6 x 12 = 72 C 10 x 3 = 30 D 8 x 10 = 80 E 4 x 1 = 4 DD Job Job time Flow time Due date Tardiness A C D B E b. Average job tardiness = 76/5 = 15.2 minutes c. Average number of jobs in the system = 828/250 = 3.31 d. SPT Job Job time Flow time Due date Tardiness E C A B D Average job tardiness = 60/5 = 12 minutes 19. Sequence Setup times Total A B C = 7 (best) A C B = 10 B A C = 16 B C A = 9 C A B = 9 C B A =
24 20. Sequence Setup times Total A B C = 5.6 A C B = 5.9 B A C = 6.2 B C A = 7.2 C A B = 6.4 C B A = 4.1 (best) 21. Sequence Setup times Total A B C D = 12 A B D C = 15 A D B C = 12 A D C B = 14 B A D C = 18 B C D A = 10 (best) C B A D = 16 C B D A = 11 C D A B = 14 C D B A = 15 D A B C = 14 D C B A = Each period s backlog is equal to actual input actual output. That amount is added to (or subtracted from) the previous backlog to obtain the current (shown) backlog for the period. Period Input Planned Actual Output Planned Actual Backlog
25 23. Period Input Planned Actual Deviation Cum. Dev Period Output Planned Actual Deviation Cum. Dev Backlog Day Mon Tue Wed Thu Fri Sat Staff needed Worker Worker (tie) Worker Worker Part-time worker No. working: Day Mon Tue Wed Thu Fri Sat Staff needed Worker Worker (tie) Worker (tie) Worker Worker (part-time worker) Worker (tie) (part-time worker) No. working:
26 26. Day Mon Tue Wed Thu Fri Sat Staff needed Worker Worker (tie) Worker Worker Worker Worker (tie) Worker (tie) Worker Worker (tie) Part-time worker No. working:
IE652 - Chapter 10. Assumptions. Single Machine Scheduling
IE652 - Chapter 10 Single Machine Scheduling 1 Assumptions All jobs are processed on a single machine Release time of each job is 0 Processing times are known with certainty Scheduling Sequencing in this
More informationSINGLE MACHINE SEQUENCING Part 2. ISE480 Sequencing and Scheduling Fall semestre
SINGLE MACHINE SEQUENCING Part 2 2011 2012 Fall semestre Minimizing Total Weighted Flowtime In a common variation of the F-problem, obs do not have equal importance. One way of distinguishing the obs is
More informationSingle Machine Problems Polynomial Cases
DM204, 2011 SCHEDULING, TIMETABLING AND ROUTING Lecture 2 Single Machine Problems Polynomial Cases Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline
More informationRCPSP Single Machine Problems
DM204 Spring 2011 Scheduling, Timetabling and Routing Lecture 3 Single Machine Problems Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Resource
More informationSingle Machine Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching
More informationC-100 C-200 SAMPLE REPORTS 1. CLOCKINGS AND HOURS 2. HOURS AND GROSS PAY (SUMMARY) 3. PAID HOURS (INC ABSENCE) SUMMARY 4. ABSENCE BY EMPLOYEE
C-400 C-250 C-100 C-200 C-230 C-300 SAMPLE REPORTS 1. CLOCKINGS AND HOURS 2. HOURS AND GROSS PAY (SUMMARY) 3. PAID HOURS (INC ABSENCE) SUMMARY 4. ABSENCE BY EMPLOYEE 5 ABSENCE (CALENDER VIEW) 6. HOLIDAY
More informationReview for Test #1 over Ch 1. Work all the problems on a separate piece of paper showing all steps.
109 Review for Test #1 over Ch 1 Work all the problems on a separate piece of paper showing all steps. Define each of the following: 1) a) Natural Numbers b) Whole Numbers c) Integers d) Rational Numbers
More informationMulti-Objective Scheduling Using Rule Based Approach
Multi-Objective Scheduling Using Rule Based Approach Mohammad Komaki, Shaya Sheikh, Behnam Malakooti Case Western Reserve University Systems Engineering Email: komakighorban@gmail.com Abstract Scheduling
More informationScheduling Lecture 1: Scheduling on One Machine
Scheduling Lecture 1: Scheduling on One Machine Loris Marchal October 16, 2012 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer
More informationScheduling Lecture 1: Scheduling on One Machine
Scheduling Lecture 1: Scheduling on One Machine Loris Marchal 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer environment,
More informationHeuristics Algorithms For Job Sequencing Problems
Global Journal of Science Frontier Research Vol.10 Issue 4(Ver1.0),September 2010 P a g e 37 Heuristics Algorithms For Job Sequencing Problems K. Karthikeyan GJSFR Classification D (FOR) 091307,091305,010303
More informationCPU Scheduling Exercises
CPU Scheduling Exercises NOTE: All time in these exercises are in msec. Processes P 1, P 2, P 3 arrive at the same time, but enter the job queue in the order presented in the table. Time quantum = 3 msec
More informationORI 390Q Models and Analysis of Manufacturing Systems First Exam, fall 1994
ORI 90Q Models and Analysis of Manufacturing Systems First Exam, fall 1994 (time, defect rate) (12,0.05) 5 6 V A (16,0.07) (15,0.07) (5,0) M 1 1 2 M1 M2 O A (10,0.1) 7 8 V B (8,0.2) M4 2 4 M5 The figure
More informationThe Assignment Problem
CHAPTER 12 The Assignment Problem Basic Concepts Assignment Algorithm The Assignment Problem is another special case of LPP. It occurs when m jobs are to be assigned to n facilities on a one-to-one basis
More informationTask Models and Scheduling
Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling
More informationOnline Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs
Submitted to Operations Research manuscript OPRE-2009-04-180 Online Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs Xiaoqiang
More informationMitrol MFG Work Centre Control
Mitrol MFG Work Centre Control Copyright Information The information in this document is subject to change without notice and should not be construed as a commitment by Mitrol. Mitrol assumes no responsibility
More informationCS 370. FCFS, SJF and Round Robin. Yashwanth Virupaksha and Abhishek Yeluri
CS 370 FCFS, SJF and Round Robin Yashwanth Virupaksha and Abhishek Yeluri Homework-4 Review Write a C program to demonstrate the following scheduling algorithms First Come First Serve. (20 pts) Shortest
More informationMountain View Community Shuttle Monthly Operations Report
Mountain View Community Shuttle Monthly Operations Report December 6, 2018 Contents Passengers per Day, Table...- 3 - Passengers per Day, Chart...- 3 - Ridership Year-To-Date...- 4 - Average Daily Ridership
More information(1) The starting point is the precedence table (aka dependence table) Immediately preceding activities
Critical Path Analysis (10 pages; 1/5/16) fmng.uk (1) The starting point is the precedence table (aka dependence table) Example Activity Duration Immediately preceding activities A 4 - B 5 - C 6 A,B D
More informationCombinatorial Structure of Single machine rescheduling problem
Workshop on Combinatorics and Optimization Combinatorial Structure of Single machine rescheduling problem Yuan Jinjiang Department of mathematics, Zhengzhou University Zhengzhou, Henan 450052 Page 1 of
More informationLecture 4 Scheduling 1
Lecture 4 Scheduling 1 Single machine models: Number of Tardy Jobs -1- Problem 1 U j : Structure of an optimal schedule: set S 1 of jobs meeting their due dates set S 2 of jobs being late jobs of S 1 are
More informationMountain View Community Shuttle Monthly Operations Report
Mountain View Community Shuttle Monthly Operations Report October 9, 2018 Contents Passengers per Day, Table...- 3 - Passengers per Day, Chart...- 3 - Ridership Year-To-Date...- 4 - Average Daily Ridership
More informationSimple Dispatch Rules
Simple Dispatch Rules We will first look at some simple dispatch rules: algorithms for which the decision about which job to run next is made based on the jobs and the time (but not on the history of jobs
More informationComp 204: Computer Systems and Their Implementation. Lecture 11: Scheduling cont d
Comp 204: Computer Systems and Their Implementation Lecture 11: Scheduling cont d 1 Today Scheduling algorithms continued Shortest remaining time first (SRTF) Priority scheduling Round robin (RR) Multilevel
More informationDecision Mathematics D1 Advanced/Advanced Subsidiary. Wednesday 23 January 2013 Morning Time: 1 hour 30 minutes
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Wednesday 23 January 2013 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included
More informationCSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD
Course Overview Material that will be covered in the course: Basic graph algorithms Algorithm Design Techniques Greedy Algorithms Divide and Conquer Dynamic Programming Network Flows Computational intractability
More informationFlow Shop and Job Shop Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 11 Flow Shop and Job Shop Models 1. Flow Shop 2. Job Shop Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Resume Permutation
More informationMERIDIAN SECONDARY SCHOOL SCIENCE DEPARTMENT MID-YEAR EXAM Format. Cells Movement of substances Nutrients Enzymes Nutrition in Humans
MID-YEAR EXAM 08 Subject: E Biology (09) Format Date Paper & Duration 8 May 08 (Tue) 0 Multiple Choice Questions 0 Structured Questions 70 ( minutes) 9 May 08 (Wed) ( hour min) MYE Topics / Cells Movement
More informationCPU Scheduling. Heechul Yun
CPU Scheduling Heechul Yun 1 Recap Four deadlock conditions: Mutual exclusion No preemption Hold and wait Circular wait Detection Avoidance Banker s algorithm 2 Recap: Banker s Algorithm 1. Initialize
More informationCPU Scheduling. CPU Scheduler
CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationDecision Mathematics D1 Advanced/Advanced Subsidiary. Tuesday 13 January 2009 Morning Time: 1 hour 30 minutes
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Tuesday 13 January 2009 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included
More informationDecision Diagrams for Sequencing and Scheduling
Decision Diagrams for Sequencing and Scheduling Willem-Jan van Hoeve Tepper School of Business Carnegie Mellon University www.andrew.cmu.edu/user/vanhoeve/mdd/ Plan What can MDDs do for Combinatorial Optimization?
More informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Department of Mathematics & Statistics Faculty of Science and Engineering END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MS4303 SEMESTER: Spring 2018 MODULE TITLE:
More informationThe Transportation Problem
CHAPTER 12 The Transportation Problem Basic Concepts 1. Transportation Problem: BASIC CONCEPTS AND FORMULA This type of problem deals with optimization of transportation cost in a distribution scenario
More informationDynamic Scheduling with Genetic Programming
Dynamic Scheduling with Genetic Programming Domago Jakobović, Leo Budin domago.akobovic@fer.hr Faculty of electrical engineering and computing University of Zagreb Introduction most scheduling problems
More informationChe-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University
Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.
More informationAn improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint J. Breit Department of Information and Technology Management, Saarland University, Saarbrcken, Germany
More informationEvolutionary Ensemble Strategies for Heuristic Scheduling
0 International Conference on Computational Science and Computational Intelligence Evolutionary Ensemble Strategies for Heuristic Scheduling Thomas Philip Runarsson School of Engineering and Natural Science
More informationEmbedded Systems Development
Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs
More informationReal-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm
Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should
More informationLecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
More informationLPT rule: Whenever a machine becomes free for assignment, assign that job whose. processing time is the largest among those jobs not yet assigned.
LPT rule Whenever a machine becomes free for assignment, assign that job whose processing time is the largest among those jobs not yet assigned. Example m1 m2 m3 J3 Ji J1 J2 J3 J4 J5 J6 6 5 3 3 2 1 3 5
More informationApproximation Algorithms for scheduling
Approximation Algorithms for scheduling Ahmed Abu Safia I.D.:119936343, McGill University, 2004 (COMP 760) Approximation Algorithms for scheduling Leslie A. Hall The first Chapter of the book entitled
More informationMotion to Review the Academic Calendar Passed by Admissions and Standards, September 24, 2009
Effective Fall 2010 Motion to Review the Academic Calendar Passed by Admissions and Standards, September 24, 2009 Each final exam will be two hours and thirty minutes. A day has been added to finals period.
More informationChapter 7 TRANSPORTATION PROBLEM
Chapter 7 TRANSPORTATION PROBLEM Chapter 7 Transportation Transportation problem is a special case of linear programming which aims to minimize the transportation cost to supply goods from various sources
More informationOperations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 27 Flow Shop Scheduling - Heuristics - Palmer, Campbell Dudek
More informationHYBRID FLOW-SHOP WITH ADJUSTMENT
K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 50 59 HYBRID FLOW-SHOP WITH ADJUSTMENT Jan Pelikán The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering
More informationCPU scheduling. CPU Scheduling
EECS 3221 Operating System Fundamentals No.4 CPU scheduling Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University CPU Scheduling CPU scheduling is the basis of multiprogramming
More information9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS
SECTION 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS 557 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS In Sections 9. and 9., you looked at linear programming problems that occurred in standard form. The constraints
More informationDecision Mathematics D1
Pearson Edexcel International Advanced Level Decision Mathematics D1 Advanced/Advanced Subsidiary Monday 1 February 2016 Afternoon Time: 1 hour 30 minutes Paper Reference WDM01/01 You must have: D1 Answer
More informationUnit 1 Writing and Evaluating Algebraic Expressions
CC Math 1A Name Unit 1 Writing and Evaluating Algebraic Expressions Day Date Lesson Assignment Mon 8/25 Lesson 1 Writing and Evaluating Algebraic Expressions Tues 8/26 Lesson 2 Combining Like Terms & Distributive
More informationScheduling with Common Due Date, Earliness and Tardiness Penalties for Multi-Machine Problems: A Survey
Scheduling with Common Due Date, Earliness and Tardiness Penalties for Multi-Machine Problems: A Survey Volker Lauff and Frank Werner 1 Otto-von-Guericke-Universität, Fakultät für Mathematik, PSF 4120,
More informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More informationAlgorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling.
Algorithm Design Scheduling Algorithms Part 2 Parallel machines. Open-shop Scheduling. Job-shop Scheduling. 1 Parallel Machines n jobs need to be scheduled on m machines, M 1,M 2,,M m. Each machine can
More informationUSING SIMULATION FOR IMPROVING THE PERFORMANCE OF A MANUFACTURING SYSTEM THROUGH DYNAMIC WORKFORCE SCHEDULING
The Pennsylvania State University The Graduate School College of Engineering USING SIMULATION FOR IMPROVING THE PERFORMANCE OF A MANUFACTURING SYSTEM THROUGH DYNAMIC WORKFORCE SCHEDULING A Thesis in Industrial
More informationModule 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained
More informationOptimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem
Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 20 Travelling Salesman Problem Today we are going to discuss the travelling salesman problem.
More informationUnit 1 Notes. Polynomials
Unit 1 Notes 1 Day Number Date Topic Problem Set 1 Wed. Sept. Operations with Signed Numbers and Order of Operations Pre-Unit Review PS (1 ) Thurs. Sept. Working with Exponents Start Exponent Laws P.S.
More informationLogic-based Benders Decomposition
Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea
More informationDecision Mathematics D1
Pearson Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Friday 17 June 2016 Afternoon Time: 1 hour 30 minutes Paper Reference 6689/01 You must have: D1 Answer Book Candidates may use any
More informationA HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE. Marmara University, Turkey 1 2
http://dx.doi.org/10.7166/26-3-1030 A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE B. Çalış 1 *, S. Bulkan 2 & F. Tunçer 3 1,2 Department of Industrial Engineering Marmara University,
More informationDecision Mathematics D1 Advanced/Advanced Subsidiary. Tuesday 9 June 2015 Morning Time: 1 hour 30 minutes
Paper Reference(s) 6689/01 Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Tuesday 9 June 2015 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included with
More informationCoin Changing: Give change using the least number of coins. Greedy Method (Chapter 10.1) Attempt to construct an optimal solution in stages.
IV-0 Definitions Optimization Problem: Given an Optimization Function and a set of constraints, find an optimal solution. Optimal Solution: A feasible solution for which the optimization function has the
More informationDeterministic Models: Preliminaries
Chapter 2 Deterministic Models: Preliminaries 2.1 Framework and Notation......................... 13 2.2 Examples... 20 2.3 Classes of Schedules... 21 2.4 Complexity Hierarchy... 25 Over the last fifty
More informationwater work RAIN BUCKET making since 1986 ET2000 (400 SERIES) RAIN BUCKET SETUP
RAIN BUCKET SETUP RAIN BUCKET ET2000 (400 SERIES) RAIN BUCKET SETUP 8 8 4 3 2 5 6 7 1 10 9 1 STOP The STOP key will stop any currently running Scheduled watering Cycle, Manual Cycle, Test Cycle, Manual
More informationGeneral Scheduling Model and
General Scheduling Model and Algorithm Andrew Kusiak 2139 Seamans Center Iowa City, Iowa 52242-1527 Tel: 319-335 5934 Fax: 319-335 5669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak MANUFACTURING
More informationAnswer ALL questions. Each question is worth 1 mark. Show All working in the working column
SECTION 1 Answer ALL questions. Each question is worth 1 mark. Show All working in the working column No TEST ITEMS WORKING COLUMNS 1 Round 4312 to the NEAREST hundred 2 Express 43% as a decimal 3 Write
More informationSection 3-3 Measures of Variation
Section 3-3 Measures of Variation Part B Created by Tom Wegleitner, Centreville, Virginia Slide 2 1 In a data list, every value falls within some number of standard deviations from the mean. Slide 3 Find
More informationA Semiconductor Wafer
M O T I V A T I O N Semi Conductor Wafer Fabs A Semiconductor Wafer Clean Oxidation PhotoLithography Photoresist Strip Ion Implantation or metal deosition Fabrication of a single oxide layer Etching MS&E324,
More informationOPERATIONS RESEARCH. Transportation and Assignment Problems
OPERATIONS RESEARCH Chapter 2 Transportation and Assignment Problems Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Optimality
More informationScheduling Parallel Jobs with Linear Speedup
Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
More informationTables and Line Graphs
4 CHAPTER Tables and Line Graphs Worksheet 1 Making and Interpreting a Table Find the parts and wholes. The table shows the number of boys and girls in a school. Number of Boys Number of Girls Total 625
More informationExample: 1. In this chapter we will discuss the transportation and assignment problems which are two special kinds of linear programming.
Ch. 4 THE TRANSPORTATION AND ASSIGNMENT PROBLEMS In this chapter we will discuss the transportation and assignment problems which are two special kinds of linear programming. deals with transporting goods
More information2/5/07 CSE 30341: Operating Systems Principles
page 1 Shortest-Job-First (SJR) Scheduling Associate with each process the length of its next CPU burst. Use these lengths to schedule the process with the shortest time Two schemes: nonpreemptive once
More informationScheduling divisible loads with return messages on heterogeneous master-worker platforms
Scheduling divisible loads with return messages on heterogeneous master-worker platforms Olivier Beaumont, Loris Marchal, Yves Robert Laboratoire de l Informatique du Parallélisme École Normale Supérieure
More informationCPU SCHEDULING RONG ZHENG
CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM
More informationPartition is reducible to P2 C max. c. P2 Pj = 1, prec Cmax is solvable in polynomial time. P Pj = 1, prec Cmax is NP-hard
I. Minimizing Cmax (Nonpreemptive) a. P2 C max is NP-hard. Partition is reducible to P2 C max b. P Pj = 1, intree Cmax P Pj = 1, outtree Cmax are both solvable in polynomial time. c. P2 Pj = 1, prec Cmax
More informationOn Machine Dependency in Shop Scheduling
On Machine Dependency in Shop Scheduling Evgeny Shchepin Nodari Vakhania Abstract One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at
More informationExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
Journal of Optimization in Industrial Engineering 15 (2014) 47-53 Exact ixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment ohammad Saidi mehrabad a, Saeed Zarghami
More informationWest Henrico Co. - Glen Allen Weather Center N W. - Koontz
PAGE #1 Oct 2017 West Henrico Co. - Glen Allen Weather Center 37.6554 N. 77.5692 W. - Koontz 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Oct Week TEMPERATURE F TEMPERATURE F SKY PRECIPITATION FROZ.
More informationName Final Exam Review
Name Final Exam Review For numbers 1 and, solve the given equation. If the solution set is, classify the equation as an identity or a contradiction. 1.) 10x 7 38x 49 1..) 13t 5 t 5 3t 1. P1 V1 P V 3.)
More informationAdvanced Modified Time Deviation Method for Job Sequencing
ABSTRACT 2018 IJSRST Volume 4 Issue 10 Print ISSN : 2395-6011 Online ISSN : 2395-602X Themed Section: Science and Technology Advanced Modified Time Deviation Method for Sequencing R Rajalakshmi 1, S Rekha
More informationScheduling problem subject to compatibility constraints
Scheduling problem subject to compatibility constraints Mohamed Bendraouche 1 and Mourad Boudhar 2 1 Faculty of Sciences, Saad Dahleb University, Route de Soumaa, BP 270, Blida, Algeria mbendraouche@yahoo.fr
More informationMINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING
Journal of the Operations Research Society of Japan Vol. 39, No. 3, September 1996 1996 The Operations Research Society of Japan MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING Tsung-Chyan Lai
More informationLesson 27 Linear Programming; The Simplex Method
Lesson Linear Programming; The Simplex Method Math 0 April 9, 006 Setup A standard linear programming problem is to maximize the quantity c x + c x +... c n x n = c T x subject to constraints a x + a x
More informationThis Job Aid walks hourly employees with benefits through the process of entering inclement weather on a time card.
This walks hourly employees with benefits through the process of entering inclement weather on a time card. Audience: Hourly USS employees with benefits. Hourly Unclassified employees with benefits Examples
More informationUnit 9 Study Sheet Rational Expressions and Types of Equations
Algebraic Fractions: Unit 9 Study Sheet Rational Expressions and Types of Equations Simplifying Algebraic Fractions: To simplify an algebraic fraction means to reduce it to lowest terms. This is done by
More informationBatch delivery scheduling with simple linear deterioration on a single machine 1
Acta Technica 61, No. 4A/2016, 281 290 c 2017 Institute of Thermomechanics CAS, v.v.i. Batch delivery scheduling with simple linear deterioration on a single machine 1 Juan Zou 2,3 Abstract. Several single
More informationEmbedded Systems 14. Overview of embedded systems design
Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The
More informationNon-Standard Constraints. Setting up Phase 1 Phase 2
Non-Standard Constraints Setting up Phase 1 Phase 2 Maximizing with Mixed Constraints Some maximization problems contain mixed constraints, like this: maximize 3x 1 + 2x 2 subject to 2x 1 + x 2 50 (standard)
More informationOn-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm
On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm Christoph Ambühl and Monaldo Mastrolilli IDSIA Galleria 2, CH-6928 Manno, Switzerland October 22, 2004 Abstract We investigate
More informationDecision Mathematics D1
Pearson Edexcel International Advanced Level Decision Mathematics D1 Advanced/Advanced Subsidiary Friday 17 June 016 Afternoon Time: 1 hour 30 minutes Paper Reference WDM01/01 You must have: D1 Answer
More informationTask Assignment. Consider this very small instance: t1 t2 t3 t4 t5 p p p p p
Task Assignment Task Assignment The Task Assignment problem starts with n persons and n tasks, and a known cost for each person/task combination. The goal is to assign each person to an unique task so
More informationMaterial and Capacity Requirements Planning with dynamic lead times.
Material and Capacity Requirements Planning with dynamic lead times. Herbert Jodlbauer, Sonja Reitner To cite this version: Herbert Jodlbauer, Sonja Reitner. Material and Capacity Requirements Planning
More informationMODELING (Integer Programming Examples)
MODELING (Integer Programming Eamples) IE 400 Principles of Engineering Management Integer Programming: Set 5 Integer Programming: So far, we have considered problems under the following assumptions:
More information