IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v213y2014i1p221-23410.1007-s10479-012-1107-4.html
   My bibliography  Save this article

Scheduling job families on non-identical parallel machines with time constraints

Author

Listed:
  • Ali Obeid
  • Stéphane Dauzère-Pérès
  • Claude Yugma

Abstract

This paper studies the scheduling of lots (jobs) of different product types (job family) on parallel machines, where not all machines are able to process all job families (non-identical machines). A special time constraint, associated to each job family, should be satisfied for a machine to remain qualified for processing a job family. This constraint imposes that the time between the executions of two consecutive jobs of the same family on a qualified machine must not exceed the time threshold of the family. Otherwise, the machine becomes disqualified. This problem comes from semiconductor manufacturing, when Advanced Process Control constraints are considered in scheduling problems. To solve this problem, two Mixed Integer Linear Programming models are proposed that use different types of variables. Numerical experiments show that the second model is much more effective, and that there is a trade-off between optimizing the scheduling objective and maximizing the number of machines that remain qualified for the job families. Two heuristics are also presented and studied in the numerical experiments. Copyright Springer Science+Business Media, LLC 2014

Suggested Citation

  • Ali Obeid & Stéphane Dauzère-Pérès & Claude Yugma, 2014. "Scheduling job families on non-identical parallel machines with time constraints," Annals of Operations Research, Springer, vol. 213(1), pages 221-234, February.
    • Handle: RePEc:spr:annopr:v:213:y:2014:i:1:p:221-234:10.1007/s10479-012-1107-4
    DOI: 10.1007/s10479-012-1107-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1107-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1107-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wieslaw Kubiak & Sheldon X. C. Lou & Yingmeng Wang, 1996. "Mean Flow Time Minimization in Reentrant Job Shops with a Hub," Operations Research, INFORMS, vol. 44(5), pages 764-776, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    2. Hyun-Jung Kim, 2018. "Bounds for parallel machine scheduling with predefined parts of jobs and setup time," Annals of Operations Research, Springer, vol. 261(1), pages 401-412, February.
    3. Stéphane Dauzère-Pérès & Sigrid Lise Nonås, 2023. "An improved decision support model for scheduling production in an engineer-to-order manufacturer," 4OR, Springer, vol. 21(2), pages 247-300, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    2. Choi, Seong-Woo & Kim, Yeong-Dae, 2009. "Minimizing total tardiness on a two-machine re-entrant flowshop," European Journal of Operational Research, Elsevier, vol. 199(2), pages 375-384, December.
    3. S-W Choi & Y-D Kim, 2007. "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 972-981, July.
    4. Wieslaw Kubiak & Yanling Feng & Guo Li & Suresh P. Sethi & Chelliah Sriskandarajah, 2020. "Efficient algorithms for flexible job shop scheduling with parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 272-288, June.
    5. JC-H Pan & J-S Chen, 2003. "Minimizing makespan in re-entrant permutation flow-shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 642-653, June.

    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:annopr:v:213:y:2014:i:1:p:221-234:10.1007/s10479-012-1107-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.