IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v159y2008i1p5-2410.1007-s10479-007-0273-2.html
   My bibliography  Save this article

Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem

Author

Listed:
  • Fehmi Tanrisever
  • Erhan Kutanoglu

Abstract

We study a scheduling problem motivated by the challenges observed in the newest semiconductor manufacturing wafer fabrication facilities. As wafers are larger and heavier in these wafer fabs, it is becoming more common to use specialized material handling containers that carry multiple orders coming from different customers and to schedule the containers as jobs in the fab. The system performance is a function of the completion times of orders, which ultimately depend on both (1) how the orders are assigned to such containers (“job formation”), and (2) how the containers are scheduled in the fab (“job scheduling”). The overall problem is to find the best way to form and schedule the jobs subject to complicating constraints, including the restrictions on the number of containers that can be used at one time and on the number of wafers the containers can carry. We focus on the single machine job formation and scheduling problem with the total completion time objective. We show that this problem is quite different from conventional parallel and serial batching scenarios and prove that the uncapacitated special case is polynomially solvable and the capacitated case is strongly NP-hard. We use a dynamic programming algorithm to solve the uncapacitated problem, which not only provides tight lower bounds for the capacitated problem, but also becomes a basis for a heuristic approach for the capacitated problem. The computational results show that this approach is very effective, leading to small optimality gaps that get even smaller as the problems become larger. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Fehmi Tanrisever & Erhan Kutanoglu, 2008. "Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem," Annals of Operations Research, Springer, vol. 159(1), pages 5-24, March.
    • Handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:5-24:10.1007/s10479-007-0273-2
    DOI: 10.1007/s10479-007-0273-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0273-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0273-2?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. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    2. Jolai Ghazvini, Fariborz & Dupont, Lionel, 1998. "Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes," International Journal of Production Economics, Elsevier, vol. 55(3), pages 273-280, August.
    3. Edward G. Coffman & Ardavan Nozari & Mihalis Yannakakis, 1989. "Optimal Scheduling of Products with Two Subassemblies on a Single Machine," Operations Research, INFORMS, vol. 37(3), pages 426-436, June.
    4. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    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. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Some results of the worst-case analysis for flow shop scheduling with a learning effect," Annals of Operations Research, Springer, vol. 211(1), pages 481-490, December.
    2. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
    3. Oleh Sobeyko & Lars Mönch, 2015. "Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems," Annals of Operations Research, Springer, vol. 235(1), pages 709-739, December.

    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. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Laub, Jeffrey D. & Fowler, John W. & Keha, Ahmet B., 2007. "Minimizing makespan with multiple-orders-per-job in a two-machine flowshop," European Journal of Operational Research, Elsevier, vol. 182(1), pages 63-79, October.
    3. Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
    4. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    5. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
    6. Alessandro Druetto & Erica Pastore & Elena Rener, 2023. "Parallel batching with multi-size jobs and incompatible job families," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 440-458, July.
    7. B. Lin & T. Cheng, 2005. "Two-Machine Flowshop Batching and Scheduling," Annals of Operations Research, Springer, vol. 133(1), pages 149-161, January.
    8. Malapert, Arnaud & Guéret, Christelle & Rousseau, Louis-Martin, 2012. "A constraint programming approach for a batch processing problem with non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 221(3), pages 533-545.
    9. Yuan Gao & Jinjiang Yuan, 2019. "Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 698-711, October.
    10. Mosheiov, Gur & Oron, Daniel, 2008. "A single machine batch scheduling problem with bounded batch size," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1069-1079, June.
    11. Yuan Gao & Jinjiang Yuan & Zhigang Wei, 2019. "Unbounded parallel-batch scheduling with drop-line tasks," Journal of Scheduling, Springer, vol. 22(4), pages 449-463, August.
    12. Yang, Fan & Davari, Morteza & Wei, Wenchao & Hermans, Ben & Leus, Roel, 2022. "Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families," European Journal of Operational Research, Elsevier, vol. 303(2), pages 602-615.
    13. Gur Mosheiov & Daniel Oron & Yaacov Ritov, 2004. "Flow‐shop batch scheduling with identical processing‐time jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 783-799, September.
    14. Zhou, Feng & Blocher, James D. & Hu, Xinxin & Sebastian Heese, H., 2014. "Optimal single machine scheduling of products with components and changeover cost," European Journal of Operational Research, Elsevier, vol. 233(1), pages 75-83.
    15. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    16. Liji Shen & Lars Mönch & Udo Buscher, 2013. "An iterative approach for the serial batching problem with parallel machines and job families," Annals of Operations Research, Springer, vol. 206(1), pages 425-448, July.
    17. Yuzhong Zhang & Zhigang Cao, 2008. "An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 16(2), pages 119-126, August.
    18. Lele Zhang & Andrew Wirth, 2010. "On-line machine scheduling with batch setups," Journal of Combinatorial Optimization, Springer, vol. 20(3), pages 285-306, October.
    19. Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes," European Journal of Operational Research, Elsevier, vol. 240(3), pages 649-665.
    20. Jason Pan & Chi-Shiang Su, 2015. "Two parallel machines problem with job delivery coordination and availability constraint," Annals of Operations Research, Springer, vol. 235(1), pages 653-664, December.

    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:159:y:2008:i:1:p:5-24:10.1007/s10479-007-0273-2. 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.