IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i6p1680-1691.html
   My bibliography  Save this article

Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines

Author

Listed:
  • Gaia Nicosia
  • Andrea Pacifici

Abstract

In this work, we address the problem of scheduling a set of n non-preemptive tasks on m dedicated machines in order to minimise the makespan. For each task deterministic processing times and a specific processing machine are given, moreover a set of precedence constraints among the tasks are known. We present a heuristic and some lower bounds on the minimum makespan for a relevant case in manufacturing applications, namely when the precedence constraints form a caterpillar graph. A caterpillar is a directed tree consisting of a single directed path and leaf nodes each of which is incident to the directed path by exactly one incoming arc. A number of computational experiments are also performed in order to test the performance of the proposed solution algorithm.

Suggested Citation

  • 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.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:6:p:1680-1691
    DOI: 10.1080/00207543.2016.1220686
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1220686
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1220686?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. Soman, C.A. & van Donk, D.P. & Gaalman, G.J.C., 2007. "Capacitated planning and scheduling for combined make-to-order and make-to-stock production in the food industry: An illustrative case study," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 191-199, July.
    3. Kolisch, Rainer, 2000. "Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 6637, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. Peter Brucker & Yu Sotskov & Frank Werner, 2007. "Complexity of shop-scheduling problems with fixed number of jobs: a survey," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(3), pages 461-481, June.
    5. Sotskov, Yu. N., 1991. "The complexity of shop-scheduling problems with two or three jobs," European Journal of Operational Research, Elsevier, vol. 53(3), pages 326-336, August.
    6. Kellerer, H. & Strusevich, V. A., 2003. "Scheduling parallel dedicated machines under a single non-shared resource," European Journal of Operational Research, Elsevier, vol. 147(2), pages 345-364, June.
    7. Blazewicz, Jacek & Kobler, Daniel, 2002. "Review of properties of different precedence graphs for scheduling problems," European Journal of Operational Research, Elsevier, vol. 142(3), pages 435-443, November.
    8. 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.
    9. Kolisch, R., 2000. "Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 127-141, March.
    10. Lee, Jae Kyu & Lee, Kyoung Jun & Park, Hung Kook & Hong, June Seok & Lee, Jung Seung, 1997. "Developing scheduling systems for Daewoo Shipbuilding: DAS project," European Journal of Operational Research, Elsevier, vol. 97(2), pages 380-395, March.
    11. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    12. Kolisch, Rainer & Heß, K., 2000. "Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7010, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    13. 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.
    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. Donghun Lee & Hyeongwon Kang & Dongjin Lee & Jeonwoo Lee & Kwanho Kim, 2023. "Deep Reinforcement Learning-Based Scheduler on Parallel Dedicated Machine Scheduling Problem towards Minimizing Total Tardiness," Sustainability, MDPI, vol. 15(4), pages 1-14, February.

    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. 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.
    2. Pamela C. Nolz, 2021. "Optimizing construction schedules and material deliveries in city logistics: a case study from the building industry," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 846-878, September.
    3. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    4. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.
    5. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    6. Fleszar, Krzysztof & Hindi, Khalil S., 2018. "Algorithms for the unrelated parallel machine scheduling problem with a resource constraint," European Journal of Operational Research, Elsevier, vol. 271(3), pages 839-848.
    7. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    8. Balaraman Rajan & N. Ravichandran, 2019. "Case Article—Agile Auto Sub Assemblies: Challenges in Managing Growth, Resource Productivity, and Demand Variability," INFORMS Transactions on Education, INFORMS, vol. 20(1), pages 41-43, September.
    9. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    10. Walter, Rico & Schulze, Philipp & Scholl, Armin, 2021. "SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 295(3), pages 857-873.
    11. García-Villoria, Alberto & Corominas, Albert & Nadal, Adrià & Pastor, Rafael, 2018. "Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints," European Journal of Operational Research, Elsevier, vol. 271(3), pages 882-895.
    12. 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.
    13. Sharda, Bikram & Akiya, Naoko, 2012. "Selecting make-to-stock and postponement policies for different products in a chemical plant: A case study using discrete event simulation," International Journal of Production Economics, Elsevier, vol. 136(1), pages 161-171.
    14. Borba, Leonardo & Ritt, Marcus & Miralles, Cristóbal, 2018. "Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 146-156.
    15. Liang Tang & Zhihong Jin & Xuwei Qin & Ke Jing, 2019. "Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design," Annals of Operations Research, Springer, vol. 275(2), pages 685-714, April.
    16. Corominas, Albert & Pastor, Rafael & Plans, Joan, 2008. "Balancing assembly line with skilled and unskilled workers," Omega, Elsevier, vol. 36(6), pages 1126-1132, December.
    17. Rifat G. Ozdemir & Tugbanur Sezen, 2016. "Component inventory allocation in assembly line balancing with fuzzy performance ratings," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 8(1), pages 29-46.
    18. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    19. Pereira, Jordi & Ritt, Marcus, 2023. "Exact and heuristic methods for a workload allocation problem with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 309(1), pages 387-398.
    20. 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.

    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:taf:tprsxx:v:55:y:2017:i:6:p:1680-1691. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.