Annals of Operations Research

, Volume 235, Issue 1, pp 653–664 | Cite as

Two parallel machines problem with job delivery coordination and availability constraint

  • Jason Chao-Hsien Pan
  • Chi-Shiang Su


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.


Scheduling Supply chain management Complexity theory Heuristic 


  1. Chang, Y. C., & Lee, Y. L. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158, 470–487.CrossRefGoogle Scholar
  2. 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.CrossRefGoogle Scholar
  3. 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.
  4. He, Y., Zhong, W., & Gu, H. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363, 257–265.CrossRefGoogle Scholar
  5. 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.CrossRefGoogle Scholar
  6. Lee, C. Y., & Chen, Z. L. (2001). Machine scheduling with transportation considerations. Journal of Scheduling, 4, 3–24.CrossRefGoogle Scholar
  7. 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.CrossRefGoogle Scholar
  8. Pinedo, M. (1995). Scheduling: Theory, algorithms, and systems. Englewoods Cliffs, NJ: Prentice-Hall.Google Scholar
  9. Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.CrossRefGoogle Scholar
  10. 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.CrossRefGoogle Scholar
  11. Soukhal, A., Oulamara, A., & Martineau, P. (2005). Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research, 161, 32–41.CrossRefGoogle Scholar
  12. 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.CrossRefGoogle Scholar
  13. Wang, Xiuli, & Cheng, T. C. E. (2007). Machine scheduling with an availability constraint and job delivery coordination. Naval Research Logistics, 54, 11–20.CrossRefGoogle Scholar
  14. Woeginger, G. J. (1994). Heuristics for parallel machine scheduling with delivery times. Acta Informatica, 31, 503–512.CrossRefGoogle Scholar
  15. 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.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Business AdministrationTakming University of Science and TechnologyTaipeiTaiwan
  2. 2.National Taipei University of TechnologyTaipeiTaiwan

Personalised recommendations