Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

A time-cost tradeoff problem with multiple interim assessments under the precedence graph with two chains in parallel

  • Received : 2018.01.30
  • Accepted : 2018.02.28
  • Published : 2018.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.

Keywords

References

  1. C. Artigues, D. Demassey., E. Neron. "Resource- Constrained Project Scheduling," Wiley, 2008.
  2. E.B. Berman. "Resource allocation in a PERT network under continuous activity time-cost function," Management Science Vol. 10, pp. 734-745, July 1964. https://doi.org/10.1287/mnsc.10.4.734
  3. J. Bell. "Beauty is in the eye of the beholder: Establishing a fair and equitable value for embryonic high-tech enterprises," Venture Capital Journal, Vol. 40, pp. 33-34, Jan. 2000.
  4. P. Bruker, A. Drexl, R. Mohring, K. Neumann, and E. Perch. "Resource-constrained project scheduling: Notations, classfication, models and methods," European Journal of Operational Research, Vol. 112, pp. 3-41, Jan. 1999. https://doi.org/10.1016/S0377-2217(98)00204-5
  5. B.C. Choi, and J.B. Chung. "Complexity results for linear time-cost tradeoff problem with multiple milestones and completely ordered jobs," European Journal of Operational Research, Vol. 236, pp. 61-68, July 2014. https://doi.org/10.1016/j.ejor.2013.11.009
  6. B.C. Choi, and M.J. Park. "A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs," European Journal of Operational Research Vol. 244, pp. 748-752, Aug. 2015. https://doi.org/10.1016/j.ejor.2015.02.022
  7. B.C. Choi, and J.B. Chung. "Some special cases of a continuous time-cost tradeoff problem with multiple milestones under a chain precedence graph," Management Science and Financial Engineering, Vol. 22, pp. 5-12, May 2016. https://doi.org/10.7737/MSFE.2016.22.1.005
  8. E.L. Demeulemeester and W.S. Herroelen. "Project scheduling - A research handbook," Kluwer Academic, 2002.
  9. D.R. Fulkerson. "A network flow computation for project cost curves," Management Science, Vol. 7, pp. 167-178, Jan. 1961. https://doi.org/10.1287/mnsc.7.2.167
  10. J.E. Falk, and J.L. Horowitz. "Critical path problems with concave cost-time curves," Management Science, Vol. 19, pp. 446-455, Dec. 1972. https://doi.org/10.1287/mnsc.19.4.446
  11. J.E. Kelley. "Critical path planning and scheduling: Mathematical basis," Operations Research, Vol. 9, pp. 296-320, June 1961. https://doi.org/10.1287/opre.9.3.296
  12. L.R. Lamberson, and R.R. Hocking. "Optimum time compression in project scheduling," Management Science, Vol. 16, pp. 597-606, June 1970. https://doi.org/10.1287/mnsc.16.10.B597
  13. J. Moussourakis, and C. Haksever. "Project compression with nonlinear cost functions," Journal of Construction Engineering and Management, Vol. 136, pp. 251-259, Feb. 2010. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000123
  14. W.A. Sahlmann. "Insights from the ventures capital model of project governance," Business Economics, Vol. 29, pp. 35-41, July 1994.
  15. J. Weglarz. "Project scheduling - Recent models algorithms and applications," Kluwer Academic, 1999.
  16. J. Weglarz, J. Jozefowska, M. Mika, and G. Waligora. "Project scheduling with finite or infinite number of activity processing modes - a survey," European Journal of Operational Research, Vol. 208, pp. 177-205, Feb. 2011. https://doi.org/10.1016/j.ejor.2010.03.037