IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v210y2011i1p39-47.html
   My bibliography  Save this article

Batch machine production with perishability time windows and limited batch size

Author

Listed:
  • Chakhlevitch, Konstantin
  • Glass, Celia A.
  • Kellerer, Hans

Abstract

This article provides a theoretical analysis of the problem of scheduling jobs in batches by family on a batch-processing machine, in the presence of perishability time windows of equal length. The problem arises in the context of production planning in a microbiological laboratory, and has application in wafer-fab production and for wireless broadcasting. The combined features of multiple families and time windows are new to the literature. The study is restricted to unit job processing times. We prove that the problem is NP-hard, thus solving an open problem by Uzsoy [24]. A Dynamic Programme is developed, with running time polynomial in the input variables of maximum batch size, the number of families and the length of the demand time horizon. In addition, we show that an heuristic approach to minimising the perishability time window can provide a 2-approximation to the optimum.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:210:y:2011:i:1:p:39-47
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00735-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to

    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. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    3. Chung-Yee Lee & Reha Uzsoy & Louis A. Martin-Vega, 1992. "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations," Operations Research, INFORMS, vol. 40(4), pages 764-775, August.
    4. Chung-Lun Li & Chung-Yee Lee, 1997. "Scheduling with agreeable release times and due dates on a batch processing machine," European Journal of Operational Research, Elsevier, vol. 96(3), pages 564-569, February.
    5. Philippe Baptiste, 2000. "Batching identical jobs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 355-367, December.
    6. 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.
    7. Jolai, Fariborz, 2005. "Minimizing number of tardy jobs on a batch processing machine with incompatible job families," European Journal of Operational Research, Elsevier, vol. 162(1), pages 184-190, April.
    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. Chakhlevitch, Konstantin & Glass, Celia A. & Shakhlevich, Natalia V., 2013. "Minimising the number of gap-zeros in binary matrices," European Journal of Operational Research, Elsevier, vol. 229(1), pages 48-58.

    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. A H Kashan & B Karimi, 2008. "Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1269-1280, September.
    3. 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.
    4. Ruyan Fu & Ji Tian & Shisheng Li & Jinjiang Yuan, 2017. "An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1187-1197, November.
    5. 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.
    6. 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.
    7. Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
    8. 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.
    9. John Tajan & Appa Sivakumar & Stanley Gershwin, 2011. "Controlling job arrivals with processing time windows into Batch Processor Buffer," Annals of Operations Research, Springer, vol. 191(1), pages 193-218, November.
    10. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    11. Xu, Rui & Chen, Huaping & Li, Xueping, 2013. "A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system," International Journal of Production Economics, Elsevier, vol. 145(1), pages 371-386.
    12. Ridouard, Frédéric & Richard, Pascal & Martineau, Patrick, 2008. "On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1327-1342, September.
    13. Guochuan Zhang & Xiaoqiang Cai & C.‐Y Lee & C.K Wong, 2001. "Minimizing makespan on a single batch processing machine with nonidentical job sizes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 226-240, April.
    14. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    15. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    16. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    17. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    18. Jia, Zhao-hong & Li, Kai & Leung, Joseph Y.-T., 2015. "Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities," International Journal of Production Economics, Elsevier, vol. 169(C), pages 1-10.
    19. Oualid Elissaouy & Karam Allali, 2025. "On a bi-objective distributed permutation flow shop problem with batch processing machines," Flexible Services and Manufacturing Journal, Springer, vol. 37(2), pages 599-631, June.
    20. 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.

    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:eee:ejores:v:210:y:2011:i:1:p:39-47. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.