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

Competitive online scheduling of perfectly malleable jobs with setup times

Author

Listed:
  • Havill, Jessen T.
  • Mao, Weizhen

Abstract

No abstract is available for this item.

Suggested Citation

  • Havill, Jessen T. & Mao, Weizhen, 2008. "Competitive online scheduling of perfectly malleable jobs with setup times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1126-1142, June.
    • Handle: RePEc:eee:ejores:v:187:y:2008:i:3:p:1126-1142
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00826-5
    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. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    2. Anja Feldmann & Ming-Yang Kao & Jiří Sgall & Shang-Hua Teng, 1998. "Optimal On-Line Scheduling of Parallel Jobs with Dependencies," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 393-411, December.
    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. Guo, Shouwei & Kang, Liying, 2010. "Online scheduling of malleable parallel jobs with setup times on two identical machines," European Journal of Operational Research, Elsevier, vol. 206(3), pages 555-561, November.
    2. Deshi Ye & Danny Z. Chen & Guochuan Zhang, 2018. "Online scheduling of moldable parallel tasks," Journal of Scheduling, Springer, vol. 21(6), pages 647-654, December.
    3. Dutta, Kaushik & VanderMeer, Debra, 2011. "Cost-based decision-making in middleware virtualization environments," European Journal of Operational Research, Elsevier, vol. 210(2), pages 344-357, April.
    4. Wu, Xiaohu & Loiseau, Patrick, 2023. "Efficient approximation algorithms for scheduling moldable tasks," European Journal of Operational Research, Elsevier, vol. 310(1), pages 71-83.

    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. Marko Ɖurasević & Domagoj Jakobović, 2019. "Creating dispatching rules by simple ensemble combination," Journal of Heuristics, Springer, vol. 25(6), pages 959-1013, December.
    2. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    3. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    4. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    5. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    6. 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.
    7. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    8. Claassen, G.D.H., 2014. "Mixed integer (0–1) fractional programming for decision support in paper production industry," Omega, Elsevier, vol. 43(C), pages 21-29.
    9. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    10. Allahverdi, Ali, 2006. "Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times," International Journal of Production Economics, Elsevier, vol. 103(1), pages 386-400, September.
    11. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    12. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    13. Alessandro Agnetis & Arianna Alfieri & Gaia Nicosia, 2009. "Single-Machine Scheduling Problems with Generalized Preemption," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 1-12, February.
    14. Ciavotta, Michele & Detti, Paolo & Meloni, Carlo & Pranzo, Marco, 2008. "A bi-objective coordination setup problem in a two-stage production system," European Journal of Operational Research, Elsevier, vol. 189(3), pages 734-745, September.
    15. Philip Doganis & Haralambos Sarimveis, 2008. "Optimal production scheduling for the dairy industry," Annals of Operations Research, Springer, vol. 159(1), pages 315-331, March.
    16. Aubry, A. & Rossi, A. & Espinouse, M.-L. & Jacomino, M., 2008. "Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1115-1125, June.
    17. Hamed Hendizadeh, S. & Faramarzi, Hamidreza & Mansouri, S.Afshin & Gupta, Jatinder N.D. & Y ElMekkawy, Tarek, 2008. "Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times," International Journal of Production Economics, Elsevier, vol. 111(2), pages 593-605, February.
    18. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    19. Allahverdi, Ali & Al-Anzi, Fawaz S., 2006. "A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times," European Journal of Operational Research, Elsevier, vol. 169(3), pages 767-780, March.
    20. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.

    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:187:y:2008:i:3:p:1126-1142. 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.