Skip to main content
SpringerLink
Log in

Two parallel machines problem with job delivery coordination and availability constraint

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Coordination and integration among various members of a supply chain has become one of the vital strategies for the modern manufacturers to gain competitive advantages. This paper studies an NP-hard problem of the two-stage scheduling in which jobs are processed by two parallel machines and delivered to the distribution center with the objective of minimizing the makespan. There exists an unavailable interval on one of the machines due to preventive maintenance and an unfinished job can resume processing after the machine becomes available again. Wang and Cheng (Nav Res Logist 54:11–20, 2007) first studied this problem and presented an algorithm H2 with a worst-case ratio of 5/3. This paper proposes a new algorithm which leads to a best possible solution with a worst-case ratio of 3/2.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Chang, Y. C., & Lee, Y. L. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158, 470–487.

    Article  Google Scholar 

  • Cheng, T. C. E., Gordon, V. S., & Kovalyov, M. Y. (1996). Single machine scheduling with batch deliveries. European Journal of Operational Research, 94, 277–283.

    Article  Google Scholar 

  • Hashemian, N., Diallo, C., & Vizvári, B. (2012). Makespan minimization for parallel machines scheduling with multiple availability constraints. Annals of Operations Research, doi:10.1007/s10479-012-1059-8.

  • He, Y., Zhong, W., & Gu, H. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363, 257–265.

    Article  Google Scholar 

  • Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1982). Recent developments in deterministic sequencing and scheduling: A survey. Deterministic and Stochastic Scheduling, 84, 35–73.

    Article  Google Scholar 

  • Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.

    Article  Google Scholar 

  • Li, C. L., Vairaktarakis, G., & Lee, C. Y. (2005). Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research, 164, 39–51.

    Article  Google Scholar 

  • Pinedo, M. (1995). Scheduling: Theory, algorithms, and systems. Englewoods Cliffs, NJ: Prentice-Hall.

    Google Scholar 

  • Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.

    Article  Google Scholar 

  • Potts, C. N., & Van, Wassenhove L. N. (1992). Integrating scheduling with batching and lot-sizing : A review of algorithms and complexity. Journal of the Operational Research Society, 43, 395–406.

    Article  Google Scholar 

  • Soukhal, A., Oulamara, A., & Martineau, P. (2005). Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research, 161, 32–41.

    Article  Google Scholar 

  • Su, C. S., Pan, J. C., & Hsu, T. S. (2009). A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theoretical Computer Science, 410, 2581–2591.

    Article  Google Scholar 

  • Wang, Xiuli, & Cheng, T. C. E. (2007). Machine scheduling with an availability constraint and job delivery coordination. Naval Research Logistics, 54, 11–20.

    Article  Google Scholar 

  • Woeginger, G. J. (1994). Heuristics for parallel machine scheduling with delivery times. Acta Informatica, 31, 503–512.

    Article  Google Scholar 

  • Zhong, W., Do’sa, G., & Tan, Z. (2007). On the machine scheduling problem with job delivery coordination. European Journal of Operational Research, 182, 1057–1072.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, Takming University of Science and Technology, 56 Huanshan Road, Section 1, Taipei, 114, Taiwan

    Jason Chao-Hsien Pan

  2. National Taipei University of Technology, No. 1, Sec. 3, Zhongxiao E. Rd., Taipei, 10608, Taiwan

    Chi-Shiang Su

Authors
  1. Jason Chao-Hsien Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chi-Shiang Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chi-Shiang Su.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pan, J.CH., Su, CS. Two parallel machines problem with job delivery coordination and availability constraint. Ann Oper Res 235, 653–664 (2015). https://doi.org/10.1007/s10479-015-1903-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-1903-8

Keywords

Search

Navigation