Using MIS (9th Edition)
9th Edition
ISBN: 9780134106786
Author: David M. Kroenke, Randall J. Boyle
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter AE, Problem AE1.1
Explanation of Solution
a.
Time taken by employees for completing the special project in Denver plant:
Special project at Denver involves Market Analysis, Quota computation, Sourcing review and Production planning.
- Time taken by employees for Quota computation is “22+30+17+31=100” hours.
- Time taken by employees for Market analysis is “17+21=38” hours.
- Time taken by employees for sourcing review is “9+22+10+21+5=67” hours.
- Time taken by employees for production planning is “12+15+21+35+20+19=122 hours”
Therefore, time taken by employees for completing the special project in Denver plant is “327”hours.
Explanation of Solution
b.
Time taken by employees for completing the special projects in Reno plant:
Special project at Reno plant involves Quota computation, Sourcing review and Production planning.
- Time taken by employees for Quota computation is “27+42=69” hours.
- Time taken by employees for Sourcing review is “17+23+21+27=88” hours.
- Time taken by employees for Production planning is “19+20+11=50” hours.
Therefore, the time taken by employees for completing the special project in Reno plant is “207” hours.
c.
Explanation of Solution
Time taken by employees for Quota Computation in Chicago plant:
Time taken by employees for special project at Chicago plant for Quota computation is: “27+12+22+29+11+29 = 130” hours.
Therefore, the time taken by employees for computation in Chicago plant is “130” hours.
Explanation of Solution
d.
Total time taken by employees for Quota Computation for all plants:
Time taken by employees for special project at Chicago plant, Denver plant and Reno plant for Quota computation is:
- Time taken by employees for Quota computation in Denver plant is “22+30+17+31=100” hours.
- Time taken by employees for Quota computation in Reno plant is “27+42=69” hours.
- Time taken by employees for special project at Chicago plant for Quota computation is: “27+12+22+29+11+29 = 130”hours.
Therefore, the total time taken by employees is: “100+69+130=299” hours.
Explanation of Solution
e.
Total labor cost for all employees in the Quota computation project:
- Suppose the hourly pay of an employee is “$30”.
- The number of hours worked by the employees on Quota computation project is “299” hours.
Labor cost= hourly wage × number of hours = 30 × 299 = $8970
Therefore, the total labor cost for all employees in the quota computation project is “8970$”.
Explanation of Solution
f.
Comparison of labor hour total for Quota computation with other projects:
- The total time taken by employees for Quota computation is: “100+69+130=299” hours.
- The total time taken by employees for market analysis is “38” hours.
- The total time taken by employees for sourcing review is “67+88+52=207” hours.
- The total time taken by employees for production planning is “122+75+50 =247” hours.
Thus, the ratio of Quota computation with Market analysis = 299/38=7.86 hours, the ratio of Quota computation with sourcing review = 299/207=1.44 hours, and the ratio of Quota computation with production planning = 299/247= 1.21 hours.
Explanation of Solution
g.
Conclusion:
From the above questions, it can be observed that Quota computation almost takes “37%” of the total time taken to complete all projects as compared to the projects – market analysis, sourcing review and production planning.
Therefore, it can be said that the labor employed in Quota computation project is less efficient as compared to the other three projects.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
In java
KeanPerson
#keanld:int
#keanEmail:String
#firstName:String
#lastName: String
KeanAlumni
-yearOfGraduation: int
- employmentStatus: String
+ KeanPerson()
+ KeanPerson(keanld: int, keanEmail:
String, firstName: String, lastName: String)
+ getKeanld(): int
+ getKeanEmail(): String
+getFirstName(): String
+ getLastName(): String
+ setFirstName(firstName: String): void
+ setLastName(lastName: String): void
+toString(): String
+getParkingRate(): double
+ KeanAlumni()
+ KeanAlumni(keanld: int, keanEmail: String,
firstName: String, lastName: String,
yearOfGraduation: int, employmentStatus: String)
+getYearOfGraduation(): int
+ setYearOfGraduation(yearOfGraduation: int): void
+toString(): String
+getParkingRate(): double
In this question, write Java code to Create and Test the superclass: Abstract KeanPerson and a subclass of the KeanPerson: KeanAlumni.
Task 1: Implement Abstract Class KeanPerson using UML (10 points)
• Four data fields
• Two constructors (1 default and 1 constructor with all…
Plz correct answer by best experts...??
Knowledge Booster
Similar questions
- Q3) using the following image matrix a- b- 12345 6 7 8 9 10 11 12 13 14 15 1617181920 21 22 23 24 25 Using direct chaotic one dimension method to convert the plain text to stego text (hello ahmed)? Using direct chaotic two-dimension method to convert the plain text to stego text?arrow_forward: The Multithreaded Cook In this lab, we'll practice multithreading. Using Semaphores for synchronization, implement a multithreaded cook that performs the following recipe, with each task being contained in a single Thread: 1. Task 1: Cut onions. a. Waits for none. b. Signals Task 4 2. Task 2: Mince meat. a. Waits for none b. Signals Task 4 3. Task 3: Slice aubergines. a. Waits for none b. Signals Task 6 4. Task 4: Make sauce. a. Waits for Task 1, and 2 b. Signals Task 6 5. Task 5: Finished Bechamel. a. Waits for none b. Signals Task 7 6. Task 6: Layout the layers. a. Waits for Task 3, and 4 b. Signals Task 7 7. Task 7: Put Bechamel and Cheese. a. Waits for Task 5, and 6 b. Signals Task 9 8. Task 8: Turn on oven. a. Waits for none b. Signals Task 9 9. Task 9: Cook. a. Waits for Task 7, and 8 b. Signals none At the start of each task (once all Semaphores have been acquired), print out a string of the task you are starting, sleep for 2-11 seconds, then print out a string saying that you…arrow_forwardProgramming Problems 9.28 Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a C program that is passed a virtual address (in decimal) on the command line and have it output the page number and offset for the given address. As an example, your program would run as follows: ./addresses 19986 Your program would output: The address 19986 contains: page number = 4 offset = 3602 Writing this program will require using the appropriate data type to store 32 bits. We encourage you to use unsigned data types as well. Programming Projects Contiguous Memory Allocation In Section 9.2, we presented different algorithms for contiguous memory allo- cation. This project will involve managing a contiguous region of memory of size MAX where addresses may range from 0 ... MAX - 1. Your program must respond to four different requests: 1. Request for a contiguous block of memory 2. Release of a contiguous block of memory 3. Compact unused holes of memory into one single block 4.…arrow_forward
- using r languagearrow_forwardProgramming Problems 9.28 Assume that a system has a 32-bit virtual address with a 4-KB page size. Write a C program that is passed a virtual address (in decimal) on the command line and have it output the page number and offset for the given address. As an example, your program would run as follows: ./addresses 19986 Your program would output: The address 19986 contains: page number = 4 offset = 3602 Writing this program will require using the appropriate data type to store 32 bits. We encourage you to use unsigned data types as well. Programming Projects Contiguous Memory Allocation In Section 9.2, we presented different algorithms for contiguous memory allo- cation. This project will involve managing a contiguous region of memory of size MAX where addresses may range from 0 ... MAX - 1. Your program must respond to four different requests: 1. Request for a contiguous block of memory 2. Release of a contiguous block of memory 3. Compact unused holes of memory into one single block 4.…arrow_forwardusing r languagearrow_forward
- Write a function to compute a Monte Carlo estimate of the Beta(3, 3) cdf, and use the function to estimate F(x) for x = 0.1,0.2,...,0.9. Compare the estimates with the values returned by the pbeta function in R.arrow_forwardWrite a function to compute a Monte Carlo estimate of the Gamma(r = 3, λ = 2) cdf, and use the function to estimate F(x) for x = 0.2, 0.4, . . . , 2.0. Compare the estimates with the values returned by the pgamma function in R.arrow_forwardusing r languagearrow_forward
- using r languagearrow_forwardYou are given a class that processes purchases for an online store. The class receives calls to: • Retrieve the prices for items from a database • Record the sold items • Update the database • Refresh the webpage a. What architectural pattern is suitable for this scenario? Illustrate your answer by drawing a model for the solution, showing the method calls/events. b. Comment on how applying this pattern will impact the modifiability of the system. c. Draw a sequence diagram for the update operation.arrow_forwardThe images I have uploaded are the part 1 to 4 and questions below are continue on the questions uploaded 5. C++ Class Template with Method Stubs #pragma once #include <iostream> #include <string> #include <stdexcept> #include <vector> template <typename T> class HashTable { private: struct Entry { std::string key; T value; bool isOccupied; bool isDeleted; Entry() : key(""), value(), isOccupied(false), isDeleted(false) {} }; Entry* table; size_t capacity; size_t size; double loadFactorThreshold; size_t customHash(const std::string& key) const { size_t hash = 5381; for (char c : key) { hash = ((hash << 5) + hash) + c; } return hash; } size_t probe(const std::string& key, bool forInsert = false) const; void resize(); public: // Constructor HashTable(size_t initialCapacity = 101); // Big…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education