Scribd Logo
Upload

Welcome to Scribd!

  • 139 views

    Tutorial Scheduling

    Uploaded by

    BrandoMonintja
    This document discusses scheduling and sequencing rules for production planning and control. It provides 5 questions with examples of assigning workers to jobs based on costs or profits, sequencing jobs using different rules like First Come First Serve and Shortest Processing Time, determining sequences to minimize makespan time for a flow shop with two machines, and scheduling jobs through two departments to minimize total processing time. The goal is to compare different sequencing methods and rules to optimize metrics like flow time, tardiness, idle time and processing time.

    Copyright:

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

    Tutorial Scheduling

    Uploaded by

    BrandoMonintja
    139 views3 pages
    This document discusses scheduling and sequencing rules for production planning and control. It provides 5 questions with examples of assigning workers to jobs based on costs or profits, sequencing jobs using different rules like First Come First Serve and Shortest Processing Time, determining sequences to minimize makespan time for a flow shop with two machines, and scheduling jobs through two departments to minimize total processing time. The goal is to compare different sequencing methods and rules to optimize metrics like flow time, tardiness, idle time and processing time.

    Original Description:

    Tutorial Scheduling

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses scheduling and sequencing rules for production planning and control. It provides 5 questions with examples of assigning workers to jobs based on costs or profits, sequencing jobs using different rules like First Come First Serve and Shortest Processing Time, determining sequences to minimize makespan time for a flow shop with two machines, and scheduling jobs through two departments to minimize total processing time. The goal is to compare different sequencing methods and rules to optimize metrics like flow time, tardiness, idle time and processing time.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    139 views3 pages

    Tutorial Scheduling

    Uploaded by

    BrandoMonintja
    This document discusses scheduling and sequencing rules for production planning and control. It provides 5 questions with examples of assigning workers to jobs based on costs or profits, sequencing jobs using different rules like First Come First Serve and Shortest Processing Time, determining sequences to minimize makespan time for a flow shop with two machines, and scheduling jobs through two departments to minimize total processing time. The goal is to compare different sequencing methods and rules to optimize metrics like flow time, tardiness, idle time and processing time.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 3

    FAKULTI KEJURUTERAAN PEMBUATAN

    UNIVERSITI TEKNIKAL MALAYSIA MELAKA

    PRODUCTION PLANNING AND CONTROL

    BMFP 4513 TUTORIAL SESI 2 2009/2010

    SCHEDULING (SEQUENCING RULES)


    Question 1
    Use the assignment method to determine the best way to assign workers to jobs, given the
    following cost information. Compute the total cost for your assignment plan.

    Question 2
    Rework problem 1 treating the numbers in the table as profits instead of costs. Compute
    the total profits.

    Question 3
    The following table contains information concerning four jobs that are awaiting
    processing at a work center.

    a) Sequence the jobs using (i) FCFS, (ii) SPT, (iii) EDD, and (iv) CR. Assume the
    list is by order of arrival.

    1
    b) For each of the method in part (a), determine (i) the average job flow, (ii) the
    average tardiness, and (iii) the average number of jobs at the work center.
    c) Is one method superior that the others? Explain.

    Question 4
    The times required to complete each of eight jobs in a two-machine flow shop are shown
    in the table below. Each job must follow the same sequence, beginning with machine A
    and moving to machine B.

    a) Determine a sequence that will minimize makespan time.


    b) Construct a chart of the resulting sequence, and find machine Bs idle time.

    Question 5
    The production manager must determine the processing sequence for seven jobs through
    grinding and deburring departments. The same sequence will be followed in both
    departments. The managers goal is to move the jobs through the two departments as
    quickly as possible. The foreman of the grinding department wants the SPT rule to be
    used to minimize the work-in-process inventory in his department.

    2
    a) Prepare a schedule using SPT for the grinding department.
    b) What is the flow time in the grinding department for the SPT sequence? What is
    the total time needed to process the seven jobs in both the grinding and deburring
    departments?
    c) Determine a sequence that will minimize the total time needed to process the jobs
    in both departments. What flow time will be the result for the grinding
    department?

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy