IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v102y2006i1p143-148.html
   My bibliography  Save this article

Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost

Author

Listed:
  • Li, Wenhua
  • Yuan, Jinjiang

Abstract

No abstract is available for this item.

Suggested Citation

  • Li, Wenhua & Yuan, Jinjiang, 2006. "Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost," International Journal of Production Economics, Elsevier, vol. 102(1), pages 143-148, July.
    • Handle: RePEc:eee:proeco:v:102:y:2006:i:1:p:143-148
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(05)00056-3
    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. 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.
    2. Chen, Chuen-Lung & Bulfin, Robert L., 1993. "Complexity of single machine, multi-criteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 70(1), pages 115-125, October.
    3. 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. Amin-Naseri, Mohammad Reza & Beheshti-Nia, Mohammad Ali, 2009. "Hybrid flow shop scheduling with parallel batching," International Journal of Production Economics, Elsevier, vol. 117(1), pages 185-196, January.

    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. 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.
    2. 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.
    3. 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.
    4. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    5. 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.
    6. Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
    7. Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M. & Slikker, M., 2008. "Batch Sequencing and Cooperation," Other publications TiSEM ed1f8fce-da76-41a6-9a9e-9, Tilburg University, School of Economics and Management.
    8. Beat Gfeller & Leon Peeters & Birgitta Weber & Peter Widmayer, 2009. "Single machine batch scheduling with release times," Journal of Combinatorial Optimization, Springer, vol. 17(3), pages 323-338, April.
    9. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    10. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
    11. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    12. Eduardo Queiroga & Rian G. S. Pinheiro & Quentin Christ & Anand Subramanian & Artur A. Pessoa, 2021. "Iterated local search for single machine total weighted tardiness batch scheduling," Journal of Heuristics, Springer, vol. 27(3), pages 353-438, June.
    13. 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.
    14. Kovalyov, M. Y. & Potts, C. N. & Strusevich, V. A., 2004. "Batching decisions for assembly production systems," European Journal of Operational Research, Elsevier, vol. 157(3), pages 620-642, September.
    15. Zhou, Shengchao & Jin, Mingzhou & Du, Ni, 2020. "Energy-efficient scheduling of a single batch processing machine with dynamic job arrival times," Energy, Elsevier, vol. 209(C).
    16. Nodari Vakhania & Badri Mamporia, 2020. "Fast Algorithms for Basic Supply Chain Scheduling Problems," Mathematics, MDPI, vol. 8(11), pages 1-19, November.
    17. 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.
    18. X Wang & L Tang, 2011. "Scheduling a single machine with multiple job processing ability to minimize makespan," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1555-1565, August.
    19. 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.
    20. Nicholas Hall & Chris Potts, 2005. "The Coordination of Scheduling and Batch Deliveries," Annals of Operations Research, Springer, vol. 135(1), pages 41-64, March.

    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:proeco:v:102:y:2006:i:1:p:143-148. 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/ijpe .

    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.