Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    A Case Study Job-Shop Project Planning and Scheduling Problem

    Uploaded by

    eleni giannopoulou
    This paper presents a case study of a job shop scheduling problem from a project planning perspective. A hierarchical production planning approach is proposed to schedule production. First, a long-term planning model produces a production plan considering promised due dates. Then, a short-term scheduling model uses the plan results to minimize total weighted tardiness. The models are coded in Pulp, a Python linear/integer programming modeler. The models include resource constraints for operators and machines with generalized precedence relations and allow alternative resources. Jobs within a project must be completed consecutively using the same resources, while operators may be assigned to multiple jobs if their full capacity is not exceeded. Numerical results are presented along with how the models can flexibly promise orders or

    Copyright:

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

    A Case Study Job-Shop Project Planning and Scheduling Problem

    Uploaded by

    eleni giannopoulou
    14 views1 page
    This paper presents a case study of a job shop scheduling problem from a project planning perspective. A hierarchical production planning approach is proposed to schedule production. First, a long-term planning model produces a production plan considering promised due dates. Then, a short-term scheduling model uses the plan results to minimize total weighted tardiness. The models are coded in Pulp, a Python linear/integer programming modeler. The models include resource constraints for operators and machines with generalized precedence relations and allow alternative resources. Jobs within a project must be completed consecutively using the same resources, while operators may be assigned to multiple jobs if their full capacity is not exceeded. Numerical results are presented along with how the models can flexibly promise orders or

    Original Title

    224

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This paper presents a case study of a job shop scheduling problem from a project planning perspective. A hierarchical production planning approach is proposed to schedule production. First, a long-term planning model produces a production plan considering promised due dates. Then, a short-term scheduling model uses the plan results to minimize total weighted tardiness. The models are coded in Pulp, a Python linear/integer programming modeler. The models include resource constraints for operators and machines with generalized precedence relations and allow alternative resources. Jobs within a project must be completed consecutively using the same resources, while operators may be assigned to multiple jobs if their full capacity is not exceeded. Numerical results are presented along with how the models can flexibly promise orders or

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    14 views1 page

    A Case Study Job-Shop Project Planning and Scheduling Problem

    Uploaded by

    eleni giannopoulou
    This paper presents a case study of a job shop scheduling problem from a project planning perspective. A hierarchical production planning approach is proposed to schedule production. First, a long-term planning model produces a production plan considering promised due dates. Then, a short-term scheduling model uses the plan results to minimize total weighted tardiness. The models are coded in Pulp, a Python linear/integer programming modeler. The models include resource constraints for operators and machines with generalized precedence relations and allow alternative resources. Jobs within a project must be completed consecutively using the same resources, while operators may be assigned to multiple jobs if their full capacity is not exceeded. Numerical results are presented along with how the models can flexibly promise orders or

    Copyright:

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

    Proceedings of the 2015 International Conference on Operations Excellence and Service Engineering

    Orlando, Florida, USA, September 10-11, 2015

    A Case Study Job-Shop Project Planning and Scheduling Problem


    Milad Akrami, Alireza Ghasemi, Uday Venkatadri and Mahdi Tajbakhsh
    Industrial Engineering Department
    Dalhousie University
    Halifax, Canada

    Abstract
    This paper, based on a real-life case study, looks at the job shop scheduling problem from a project planning and
    scheduling perspective. In the job-shop in question, every client customer order is considered as a project with a batch
    of parts. We propose a hierarchical production planning approach to scheduling production. First, a planning model
    produce a long-term plan for the production considering promised due-dates. Then, the result from the planning model
    is used in the scheduling model to provide a short-term schedule for the production, whose objective is to minimize
    total weighted tardiness. The optimization model is coded in Pulp, a linear/integer programming modeler written in
    Python, which can call standard LP/MIP packages. There are multiple resource constraints (operators and machines)
    with generalized precedence relations. Also, alternative resources may be used for jobs within a project. However,
    there is a requirement that the entire batch be completed consecutively and the same resources be used for all jobs in
    a batch. Once a machine resource is assigned to a job, no other jobs can be allocated to the resource during the job
    processing time. However, with operator usage, some batches may not require the resource’s full capacity. Hence,
    operators may be assigned to more than one job during a specific period, to the extent of their full capacity. Some
    numerical results are presented as well as how the model can be used flexibly to either promise orders or reschedule
    batches in case of unforeseen delays due to machine breakdown or operator unavailability.

    © IEOM Society
    626

    You might also like