Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Problems in PPC

    Uploaded by

    rajya lakshmi
    The document contains information about various production scheduling and forecasting problems across multiple units. Unit 1 discusses forecasting sales using least squares method and moving averages. It also covers linear regression and exponential smoothing. Unit 2 covers economic order quantity and cycle time calculations. Unit 3 discusses shortest processing time, Johnson's rule, and other scheduling algorithms to minimize completion times for jobs assigned to machines. It provides examples with processing times and due dates to calculate average flow time and tardiness under different sequencing rules.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Problems in PPC

    Uploaded by

    rajya lakshmi
    40 views4 pages
    The document contains information about various production scheduling and forecasting problems across multiple units. Unit 1 discusses forecasting sales using least squares method and moving averages. It also covers linear regression and exponential smoothing. Unit 2 covers economic order quantity and cycle time calculations. Unit 3 discusses shortest processing time, Johnson's rule, and other scheduling algorithms to minimize completion times for jobs assigned to machines. It provides examples with processing times and due dates to calculate average flow time and tardiness under different sequencing rules.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains information about various production scheduling and forecasting problems across multiple units. Unit 1 discusses forecasting sales using least squares method and moving averages. It also covers linear regression and exponential smoothing. Unit 2 covers economic order quantity and cycle time calculations. Unit 3 discusses shortest processing time, Johnson's rule, and other scheduling algorithms to minimize completion times for jobs assigned to machines. It provides examples with processing times and due dates to calculate average flow time and tardiness under different sequencing rules.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    40 views4 pages

    Problems in PPC

    Uploaded by

    rajya lakshmi
    The document contains information about various production scheduling and forecasting problems across multiple units. Unit 1 discusses forecasting sales using least squares method and moving averages. It also covers linear regression and exponential smoothing. Unit 2 covers economic order quantity and cycle time calculations. Unit 3 discusses shortest processing time, Johnson's rule, and other scheduling algorithms to minimize completion times for jobs assigned to machines. It provides examples with processing times and due dates to calculate average flow time and tardiness under different sequencing rules.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 4

    UNIT-1

    1. Following data gives the sales of the company for various years. Forecast the sales for the
    year 2016 using least square method.

    A manufacturing company has monthly demand for one of its product as follows
    i) Develop a 3-period moving average forecast.
    ii) Develop 3 period weighted moving average forecast with weights of 0.5, 0.3, 0.2

    The demand for six consecutive periods for a product is as follows:


    105,108,112,116,120,130.
    i) Establish a linear forecast.
    ii) Determine the forecasted demand in 11th period.
    The sales revenue of M/S Sunder garments during 2008 to 2016 is as following. Estimate the
    sales forecast for year 2017 using least square method.

    A firm uses simple exponential smoothing with α=0.02 to forecast demand. The forecast for
    the first week of January was 400 units, whereas actual demand turned out to be 450 units.
    i) Forecast the demand for the second week of January.
    ii) Assume that the actual demand during the second week of
    January turned out to be 460 units. Forecast the demand up to February third week, assuming
    the subsequent Demands as 465, 434, 420, 498 and 462 units.

    UNIT-2
    1. If a product is to be manufactured within the company, the details are as follows:
    Annual demand rate =24000 units
    Production rate =48000 units
    Page 3 of 4
    Setup cost =Rs. 200 per setup
    Carrying cost= Rs.20/unit/year.
    Find the a) EOQ and b) Cycle time
    A company requires 10000 units of an item per annum. The cost of ordering is Rs.100 per
    order. The inventory carrying cost is 20%. The unit price of the item is Rs.10. Calculate
    i) the economic order quantity
    ii) Optimal total annual cost
    iii) time between the orders.

    UNIT-3

    A painting contractor has five houses to paint. Following are the estimated times required to
    paint each house and due date for completion. Use the Shortest Processing Time rule to
    sequence the five jobs. Compute average flow time and average tardiness per job using this
    sequence.

    Five job tasks have to be assigned to two machines (Ml and M2) as per the order shown in
    Table 1. From the data, find the sequence that minimizes the total elapsed time and find the
    minimum time by using Johnsons rule.
    Table 1: Job allotment to machines and respective time (Min) required to complete the tasks

    Seven job tasks have to be assigned to two machines (Ml and M2) as per the order shown in
    Table 1. From the data, find the sequence that minimizes the total elapsed time and find the
    minimum time by using Johnsons rule.
    Table 1: Job allotment to machines and respective time (Min) required to complete the tasks
    Processing times and due dates for six jobs waiting to be processed at a work centre are
    given. Determine the sequence of jobs, average flow time, average tardiness and average
    number of jobs at the work centre for each of these rules i) FCFS ii) SPT iii) EDD iv) CR
    Assume jobs arrive in the order shown.

    Six jobs go over two machines M1 & M2 in the following order. Find the sequence that
    minimizes the total elapsed time using Johnson’s rule.

    A student at an university has five term papers due soon and he must decide in what order to
    complete them. Below are the estimated number of days required to complete each paper and
    due dates. i. Use the shortest processing time rule to sequence the jobs. Compute the average
    flow time and average tardiness per job using this sequence. ii. Use Earliest Due date rule to
    sequence the jobs. Compute the average flow time and average tardiness per job using this
    sequence.
    Group the following Elements into work stations by using “RPW” method
    (The Example belongs to small Electrical Appliance)

    You might also like