IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i2d10.1007_s10878-014-9787-0.html
   My bibliography  Save this article

Scheduling dedicated jobs with variative processing times

Author

Listed:
  • Maksim Barketau

    (United Institute of Informatics Problems of the National Academy of Sciences)

  • Erwin Pesch

    (University of Siegen)

  • Yakov Shafransky

    (United Institute of Informatics Problems of the National Academy of Sciences)

Abstract

We consider the following optimization problem. There is a set of $$n$$ n dedicated jobs that are to be processed on $$m$$ m parallel machines. The job set is partitioned into subsets and jobs of each subset have a common due date. Processing times of jobs are interconnected and they are the subject of the decision making. The goal is to choose a processing time for each job in a feasible way and to construct a schedule that minimizes the maximum lateness. We show that the problem is NP-hard even if $$m=1$$ m = 1 and that it is NP-hard in the strong sense if $$m$$ m is a variable. We prove that there is no approximate polynomial algorithm with guaranteed approximation ratio less than 2. We propose an integer linear formulation for the problem and perform experiments. The experiments show that the solutions obtained with CPLEX within the limit of 5 min are on average about 5 % from the optimum value for instances with up to 150 jobs, 16 subsets and 11 machines. Most instances were solved to optimality and the average CPLEX running time was 32 s for these instances.

Suggested Citation

  • Maksim Barketau & Erwin Pesch & Yakov Shafransky, 2016. "Scheduling dedicated jobs with variative processing times," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 774-785, February.
  • Handle: RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9787-0
    DOI: 10.1007/s10878-014-9787-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9787-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-014-9787-0?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. Nils Boysen & Florian Jaehn & Erwin Pesch, 2011. "Scheduling Freight Trains in Rail-Rail Transshipment Yards," Transportation Science, INFORMS, vol. 45(2), pages 199-211, May.
    2. Boysen, Nils & Fliedner, Malte, 2010. "Determining crane areas in intermodal transshipment yards: The yard partition problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 336-342, July.
    3. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    Full references (including those not matched with items on IDEAS)

    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. Stefan Fedtke & Nils Boysen, 2017. "Gantry crane and shuttle car scheduling in modern rail–rail transshipment yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 473-503, March.
    2. Alena Otto & Xiyu Li & Erwin Pesch, 2017. "Two-Way Bounded Dynamic Programming Approach for Operations Planning in Transshipment Yards," Transportation Science, INFORMS, vol. 51(1), pages 325-342, February.
    3. Konrad Stephan & Nils Boysen, 2017. "Crane scheduling in railway yards: an analysis of computational complexity," Journal of Scheduling, Springer, vol. 20(5), pages 507-526, October.
    4. Schulz, Arne & Fliedner, Malte & Fiedrich, Benedikt & Pfeiffer, Christian, 2021. "Levelling crane workload in multi-yard rail-road container terminals," European Journal of Operational Research, Elsevier, vol. 293(3), pages 941-954.
    5. Lennart Zey & Dirk Briskorn & Nils Boysen, 2022. "Twin-crane scheduling during seaside workload peaks with a dedicated handshake area," Journal of Scheduling, Springer, vol. 25(1), pages 3-34, February.
    6. Yan, Baicheng & Jin, Jian Gang & Zhu, Xiaoning & Lee, Der-Horng & Wang, Li & Wang, Hua, 2020. "Integrated planning of train schedule template and container transshipment operation in seaport railway terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    7. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    8. Roy, Debjit & van Ommeren, Jan-Kees & de Koster, René & Gharehgozli, Amir, 2022. "Modeling landside container terminal queues: Exact analysis and approximations," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 73-102.
    9. Martin Tschöke & Nils Boysen, 2018. "Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 319-339, March.
    10. Basallo-Triana, Mario José & Bravo-Bastidas, Juan José & Vidal-Holguín, Carlos Julio, 2022. "A rail-road transshipment yard picture," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    11. Amir Gharehgozli & Debjit Roy & Suruchika Saini & Jan-Kees Ommeren, 2023. "Loading and unloading trains at the landside of container terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(3), pages 549-575, September.
    12. Guo, Peng & Weidinger, Felix & Boysen, Nils, 2019. "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals," Omega, Elsevier, vol. 89(C), pages 110-121.
    13. Kress, Dominik & Meiswinkel, Sebastian & Pesch, Erwin, 2015. "The Partitioning Min–Max Weighted Matching Problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 745-754.
    14. Mateusz Cichenski & Florian Jaehn & Grzegorz Pawlak & Erwin Pesch & Gaurav Singh & Jacek Blazewicz, 2017. "An integrated model for the transshipment yard scheduling problem," Journal of Scheduling, Springer, vol. 20(1), pages 57-65, February.
    15. Rupp, Johannes & Boysen, Nils & Briskorn, Dirk, 2022. "Optimizing consolidation processes in hubs: The hub-arrival-departure problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1051-1066.
    16. Maksim Barketau & Erwin Pesch, 2016. "An approximation algorithm for a special case of the asymmetric travelling salesman problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4205-4212, July.
    17. Nils Boysen & Joachim Scholl & Konrad Stephan, 2017. "When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 137-164, January.
    18. Albareda-Sambola, Maria & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2019. "Reformulated acyclic partitioning for rail-rail containers transshipment," European Journal of Operational Research, Elsevier, vol. 277(1), pages 153-165.
    19. Gang Ren & Xiaohan Wang & Jiaxin Cai & Shujuan Guo, 2021. "Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area," Sustainability, MDPI, vol. 13(3), pages 1-24, January.
    20. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.

    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:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9787-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.