IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-58405-3_44.html
   My bibliography  Save this book chapter

Order Acceptance and Scheduling in Capacitated Job Shops

In: Operations Research Proceedings 2023

Author

Listed:
  • Florian Linß

    (TU Dresden)

  • Mike Hewitt

    (Loyola University Chicago)

  • Janis S. Neufeld

    (TU Dresden)

  • Udo Buscher

    (TU Dresden)

Abstract

We consider a capacitated job shop problem with order acceptance. This research is motivated by the management of a research and development project pipeline for a company in the agricultural industry whose success depends on regularly releasing new and innovative products. The setting requires the consideration of multiple problem characteristics not commonly considered in scheduling research. Each job has a given release and due date and requires the execution of an individual sequence of operations on different machines (job shop). There is a set of machines of fixed capacity, each of which can process multiple operations simultaneously. Given that typically only a small percentage of jobs yield a commercially viable product, the number of potential jobs to schedule is in the order of several thousands. Due to limited capacity, not all jobs can be started. Instead, the objective is to maximize the throughput. Namely, to start as many jobs as possible. We present a Mixed Integer Programming (MIP) formulation of this problem and study how resource capacity and the option to delay jobs can impact research and development throughput. We show that the MIP formulation can prove optimality even for very large instances with less restrictive capacity constraints, while instances with a tight capacity are more challenging to solve.

Suggested Citation

  • Florian Linß & Mike Hewitt & Janis S. Neufeld & Udo Buscher, 2025. "Order Acceptance and Scheduling in Capacitated Job Shops," Lecture Notes in Operations Research, in: Guido Voigt & Malte Fliedner & Knut Haase & Wolfgang Brüggemann & Kai Hoberg & Joern Meissner (ed.), Operations Research Proceedings 2023, chapter 0, pages 341-347, Springer.
  • Handle: RePEc:spr:lnopch:978-3-031-58405-3_44
    DOI: 10.1007/978-3-031-58405-3_44
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnopch:978-3-031-58405-3_44. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.