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

Minimizing number of tardy jobs on a batch processing machine with incompatible job families

Author

Listed:
  • Jolai, Fariborz

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:162:y:2005:i:1:p:184-190
    as

    Download full text from publisher

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

    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. 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.
    2. Dorit S. Hochbaum & Dan Landy, 1997. "Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime," Operations Research, INFORMS, vol. 45(6), pages 874-885, December.
    3. 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.
    4. Javad H. Ahmadi & Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "Batching and Scheduling Jobs on Batch and Discrete Processors," Operations Research, INFORMS, vol. 40(4), pages 750-763, August.
    5. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    6. 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.
    7. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Bin Ji & Xin Xiao & Samson S. Yu & Guohua Wu, 2023. "A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families," Sustainability, MDPI, vol. 15(5), pages 1-25, February.
    6. 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.
    7. Jae Won Jang & Yong Jae Kim & Byung Soo Kim, 2022. "A Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities," Mathematics, MDPI, vol. 10(4), pages 1-26, February.
    8. 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.
    9. 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.
    10. 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.

    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. 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.
    3. 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.
    4. Sung, Chang Sup & Kim, Young Hwan & Yoon, Sang Hum, 2000. "A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines," European Journal of Operational Research, Elsevier, vol. 121(1), pages 179-192, February.
    5. Sup Sung, Chang & Hwan Kim, Young, 2003. "Minimizing due date related performance measures on two batch processing machines," European Journal of Operational Research, Elsevier, vol. 147(3), pages 644-656, June.
    6. 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.
    7. Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.
    8. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    9. 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.
    10. Xiaotie Deng & Chung Keung Poon & Yuzhong Zhang, 2003. "Approximation Algorithms in Batch Processing," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 247-257, September.
    11. 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.
    12. Gregory Dobson & Ramakrishnan S. Nambimadom, 2001. "The Batch Loading and Scheduling Problem," Operations Research, INFORMS, vol. 49(1), pages 52-65, February.
    13. 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.
    14. Zhou, Shengchao & Xie, Jianhui & Du, Ni & Pang, Yan, 2018. "A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 254-268.
    15. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    16. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    17. Li, Kai & Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "Integrated production and delivery on parallel batching machines," European Journal of Operational Research, Elsevier, vol. 247(3), pages 755-763.
    18. Sung, C. S. & Choung, Y. I., 2000. "Minimizing makespan on a single burn-in oven in semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 120(3), pages 559-574, February.
    19. 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.
    20. 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.

    More about this item

    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:162:y:2005:i:1:p:184-190. 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.