You are required to use a Genetic
A restaurant manager wants to know how many employees are needed at the restaurant each hour of the day. All employees work weekday except for weekend because the restaurant is closed during weekend. A shift is given using a starting time and a shift duration. (Breaks are ignored)
a.Assume that the restaurant manager has hired 30 employees and each employee must be working for 8 hours per day.
i.Construct a staff planning and a restaurant planning for the case study.
ii.Suggest TWO (2) sizes of generation, find the best planning for the restaurant manager. Discuss your finding.
(b)Let say,a minimum number of employees needed at any hour is 3. After that, one additional employee is required for each 20 customers. The restaurant is open 24 hours a day. (The number of employees and working duration are same with (a))
i.Construct a staff planning, customer planning as well as a restaurant planning for this new problem.
ii.Using the best size of generation that you have obtained in (a)(ii), find the best planning for the restaurant manager.
(c)Let say, the manager has counted the number of customers each hour for 14 days. The manager will use the average number of customers for each hour over the 14 days to calculate the needed number of employees for each hour. (The number of employees and working duration are same with (a) and (b))
i. Construct a staff planning, customer planning as well as a restaurant planning for this new problem.
ii. Using the best size of generation that you have obtained in (a)(ii), find the best planning for the restaurant manager.
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
- Complete the following codearrow_forwardPLEASE CODE IN PYTHON Problem Description Fiona commutes to work each day. If there is no rush-hour traffic, her commute time is 2 hours. However, there is often rush-hour traffic. Specifically, rush-hour traffic occurs from 07:00 (7am) until 10:00 (10am) in the morning and 15:00 (3pm) until 19:00 (7pm) in the afternoon. During rush-hour traffic, her speed is reduced by half. She leaves either on the hour (at XX:00), 20 minutes past the hour (at XX:20), or 40 minutes past the hour (at XX:40). Given Fiona's departure time, at what time does she arrive at work? Input Specification The input will be one line, which contains an expression of the form HH:MM, where HH is one of the 24 starting hours (00, 01, . . ., 23) and MM is one of the three possible departure minute times (00, 20, 40). Output Specification Output the time of Fiona's arrival, in the form HH:MM. Sample Input 1 05:00 Output for Sample Input 1 07:00 Explanation for Output for Sample Input 1 Fiona does not encounter any…arrow_forwardQuestion 12: Code the given problem using python The Physics teacher in Alexandra's class is teaching concepts of a bouncing ball. The rubber ball that she is using has the property that if the ball is dropped from height H then, it bounces back to maximum height H/F. So, after first bounce it rises up to maximum height H/F, after second bounce to maximum height H/F?, after third bounce to maximum height H/F3, and so on. The class has N children, and the teacher wants to select two children such that when the taller child drops the ball from his height, ball reaches a maximum height equal to the height of the shorter child after some (possibly zero) number of bounces. Note that zero bounces mean heights of the two children will be same. Given the heights of the children in the class Height[), can you tell how many ways are there for the teacher to select two children for the demonstration? Note that when heights are same, the pair is only counted once (See input and output for further…arrow_forward
- Problem C: Snake Eves on Crazy Dice Write a program that simulates rolling two twenty-sided dice 100000 times, counting now many times the sum of the two dice is 2. Based on these results as well as the results of the program (snakeeyes.py) shown in class, make a guess as to how often one can expect to roll snake-eyes (two Is) on a pair of dice labeled I through n, for any positive integer n. Sample Run You got snake-eyes 35 times out of 100000. That is .035 percent of the time. Roughly, that is 1 in 2857 times. Note: The numbers shown above are NOT realistic. This is just to show the format desired for your output. In Python Codearrow_forwardMake a C programming of: The utilities commission has decided that the electric company overcharged its customer for 2 months last year. To make up the difference to the customers, the commission orders the company to decrease each of next month’s bill by 10%. The city also levies a 3% utility tax, which is to be applied to the bill before it is discounted. Also, the 10% discount does not apply to the utility tax. Assume electricity costs 25.50 per kilowatt. Create the program to compute for next month’s electricity bill.arrow_forwardPYTHON CODE: In this scenario you are the responsible engineer that optimize Air traffic flow of Ataturk Airport. Each day, number of airplanes take-off and landing varies between 50 and 70 each. However, if weather conditions go rough in Istanbul, it affects (decrease) %60 of landing and %40 of take-off. In Istabul possibility of rough weather events observed as 0.3 (%30). Create daily weather for a month considering rough weather possibility and print on screen. Calculate number of airplanes take-off and landing separately every day for a month. Calculate total take-off and landing for a month. Calculate low-median, high-median, median, mean and stdev of take-off and landing every day for a month. Sample Output: daily weather for a month: [1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1] daily take_off for a month: [61, 62, 61, 66, 54, 58, 40, 41, 54, 56, 52, 64, 51, 61, 53, 57, 54, 65, 39, 56, 70, 57, 62, 32, 59, 33, 35, 58, 39, 58] monthly…arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education