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

Scheduling three chains on two parallel machines

Author

Listed:
  • Agnetis, Alessandro
  • Flamini, Marta
  • Nicosia, Gaia
  • Pacifici, Andrea

Abstract

We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identical machines with the objective of minimizing the makespan. The problem is known to be strongly NP-hard. Here, we prove that it is binary NP-hard even with three chains. Furthermore, we characterize the complexity of this case by presenting a pseudopolynomial time algorithm and a fully polynomial time approximation scheme.

Suggested Citation

  • Agnetis, Alessandro & Flamini, Marta & Nicosia, Gaia & Pacifici, Andrea, 2010. "Scheduling three chains on two parallel machines," European Journal of Operational Research, Elsevier, vol. 202(3), pages 669-674, May.
    • Handle: RePEc:eee:ejores:v:202:y:2010:i:3:p:669-674
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00504-9
    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. Herrmann, Jeffrey & Proth, Jean-Marie & Sauer, Nathalie, 1997. "Heuristics for unrelated machine scheduling with precedence constraints," European Journal of Operational Research, Elsevier, vol. 102(3), pages 528-537, November.
    2. J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "Complexity of Scheduling under Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 22-35, February.
    3. Lushchakova, Irene N., 2006. "Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints," European Journal of Operational Research, Elsevier, vol. 171(1), pages 107-122, May.
    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. Xing Chai & Wenhua Li, 2018. "Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 472-492, August.
    2. Agnetis, Alessandro & Kellerer, Hans & Nicosia, Gaia & Pacifici, Andrea, 2012. "Parallel dedicated machines scheduling with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 221(2), pages 296-305.
    3. Gaia Nicosia & Andrea Pacifici, 2017. "Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1680-1691, March.

    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. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    2. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    3. Daniel D. Zeng & J. Leon Zhao, 2005. "Effective Role Resolution in Workflow Management," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 374-387, August.
    4. 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.
    5. Yan Zhao & Liping Chen & Gang Xie & Jianjun Zhao & Jianwan Ding, 2018. "GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 293-317, January.
    6. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    7. Katarina Cechlarova & Bettina Klaus & David F.Manlove, 2018. "Pareto optimal matchings of students to courses in the presence of prerequisites," Cahiers de Recherches Economiques du Département d'économie 16.04, Université de Lausanne, Faculté des HEC, Département d’économie.
    8. Ahadi, Khatereh & Sullivan, Kelly M. & Mitchell, Kenneth Ned, 2018. "Budgeting maintenance dredging projects under uncertainty to improve the inland waterway network performance," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 63-87.
    9. Christoph Ambühl & Monaldo Mastrolilli & Nikolaus Mutsanas & Ola Svensson, 2011. "On the Approximability of Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 653-669, November.
    10. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    11. Bryant, Richard & Lakner, Peter & Pinedo, Michael, 2022. "On the optimality of the earliest due date rule in stochastic scheduling and in queueing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 202-212.
    12. Ntuen, Celestine A. & Park, Eui H., 1995. "An experiment in scheduling and planning of non-structured jobs: Lessons learned from artificial intelligence and operational research toolbox," European Journal of Operational Research, Elsevier, vol. 84(1), pages 96-115, July.
    13. Markó Horváth & Tamás Kis, 2020. "Polyhedral results for position-based scheduling of chains on a single machine," Annals of Operations Research, Springer, vol. 284(1), pages 283-322, January.
    14. W L Pearn & S H Chung & M H Yang & Y H Chen, 2004. "Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1194-1207, November.
    15. Browning, Tyson R. & Yassine, Ali A., 2010. "Resource-constrained multi-project scheduling: Priority rule performance revisited," International Journal of Production Economics, Elsevier, vol. 126(2), pages 212-228, August.
    16. Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2021. "Production and transport scheduling in flexible job shop manufacturing systems," Journal of Global Optimization, Springer, vol. 79(2), pages 463-502, February.
    17. 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.
    18. Prahalad Venkateshan & Joseph Szmerekovsky & George Vairaktarakis, 2020. "A cutting plane approach for the multi-machine precedence-constrained scheduling problem," Annals of Operations Research, Springer, vol. 285(1), pages 247-271, February.
    19. Mansini, Renata & Zanella, Marina & Zanotti, Roberto, 2023. "Optimizing a complex multi-objective personnel scheduling problem jointly complying with requests from customers and staff," Omega, Elsevier, vol. 114(C).
    20. Cheng, T.C.E. & Ng, C.T. & Yuan, J.J., 2008. "Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time," European Journal of Operational Research, Elsevier, vol. 191(2), pages 320-331, 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:eee:ejores:v:202:y:2010:i:3:p:669-674. 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.