Skip to main content
SpringerLink
Log in

Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

Under consideration is the NP-hard problem of makespan scheduling on two machines in the presence of a partial precedence order between the operations, with the criterion of minimization of the moment of completion of all operations. An approximation algorithm with a guaranteed precision estimate is proposed for this problem. Polynomial solvability of the problem is proved in the case when each operation on the first machine is in the precedence relation with exactly two operations on the second machine. The corresponding algorithm is developed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. A. Romanova and I. B. Cheredova, “A Two-Machine Scheduling Problem with Partial Precedence Order,” in Proceedings of the V International Asian School-Seminar “Optimization Problems of Complex Systems,” Bishkek, Kyrgyzstan, August 12–22, 2009 (Inst. Vychisl.Mat.Mat. Geofiz.,Novosibirsk, 2009), pp. 119–124.

    Google Scholar 

  2. U. M. Apte and S. Viswanathan, “Effective Cross Docking for Improving Distribution Efficiencies,” Internat. J. Logist. Res. Appl. 3 (3), 291–302 (2000).

    Article  Google Scholar 

  3. N. Boysen and M. Fliedner, “Cross Dock Scheduling: Classification, Literature Review, and Research Agenda,” Omega 38 (6), 413–422 (2010).

    Article  Google Scholar 

  4. F. Chen and Ch.-Y. Lee, “Minimizing theMakespan in a Two-Machine Cross-Docking Flow Shop Problem,” European J. Oper. Res. 193 (1), 59–72 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  5. F. Chen and K. Song, “Minimizing Makespan in Two-Stage Hybrid Cross Docking Scheduling Problem,” Comput. Oper. Res. 36 (6), 2066–2073 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  6. S. M. Johnson, “Optimal Two- And Three-Stage Production Schedules with Setup Times Included,” Naval Res. Logist. Quart. 1 (1), 61–68 (1954).

    Article  Google Scholar 

  7. D. Prot and C. Rapine, “Approximations for the Two-Machine Cross-Docking Flow Shop Problem,” Discrete Appl. Math. 161 (13–14), 2107–2119 (2013).

    Article  MATH  MathSciNet  Google Scholar 

  8. B. Vahdani and M. Zandieh, “Scheduling Trucks in Cross-Docking Systems: Robust Meta-Heuristics,” Comput. Indust. Eng. 58 (1), 12–24 (2010).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk Law Academy, ul. Korolenko 12, Omsk, 644010, Russia

    A. A. Romanova

  2. Omsk State University, pr.Mira 55-a, Omsk, 644077, Russia

    A. A. Romanova

Authors
  1. A. A. Romanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Romanova.

Additional information

Original Russian Text © A.A. Romanova, 2015, published in Diskretnyi Analiz i Issledovanie Operatsii, 2015, Vol. 22, No. 4, pp. 63–77.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Romanova, A.A. Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem. J. Appl. Ind. Math. 9, 570–579 (2015). https://doi.org/10.1134/S1990478915040134

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478915040134

Keywords

Search

Navigation