Robust Project Scheduling with Two Constrained Resources

Rong-Hwa Huang; Chang-Lin Yang

doi:doi:10.11648/j.sjbm.20130101.14

| Peer-Reviewed

Robust Project Scheduling with Two Constrained Resources

Rong-Hwa Huang, Chang-Lin Yang

Published in Science Journal of Business and Management (Volume 1, Issue 1)

Received: 5 June 2013 Published: 30 June 2013

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack times. This study utilized a novel parallel tabu search scheme to simulate multiple CPUs searching for the optimum value. The parallel tabu search outperformed the conventional tabu search in terms of exploration. For model verification, test datasets from the project scheduling problem library (PSPLIB) were adopted. Analytical results show that parallel tabu search exceeded the conventional tabu search in optimizing the objective value.

Published in	Science Journal of Business and Management (Volume 1, Issue 1)
DOI	10.11648/j.sjbm.20130101.14
Page(s)	19-25
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2013. Published by Science Publishing Group

Keywords

Resource Constraint, Project Scheduling, Parallel Tabu Search, Slack Time, Robustness, Project Completion Time

References

[1]	Al-Fawzan, M.A. and Mohamed, H. (2005), "A bi-objective model for robust resource-constrained project scheduling", International Journal of Production economics, 96(2), 175-187.
[2]	Bell, C.E. and Han, J., (1991), "A new heuristic solution method in resource-constrained project scheduling", Naval Research Logistics, 38(3), 315-331.
[3]	Boctor, F., (1990), "Some efficient multi-heuristic procedures for resource-constrained project scheduling", European Journal of Operational Research, 49(1), 3-13.
[4]	Bozejko, W. and Wodecki, M., (2004), Parallel tabu search method approach for very difficult permutation scheduling problems’, Parallel Computing in Electrical Engineering 2004 International Conference, 156-161.
[5]	Cogill, R. and Hindi, H., (2007), "Optimal routing and scheduling in flexible manufacturing systems using integer programming", IEEE Conference on Decision and Control, 4095-4102.
[6]	Davis, E.W. and Patterson, J.H., (1975), "A comparison of heuristic and optimum solutions in resource-constrained project scheduling", Management Science, 21(8), 944-955.
[7]	Dorigo, M. and Gambardella, L.M., (1997), "Ant colony system: a cooperative learning approach to the traveling salesman problem", IEEE Transactions on Evolutionary Computation, 1(1), 53-66.
[8]	Fiechter, C.N., (1994), "A parallel tabu search algorithm for large traveling salesman problems", Discrete Applied Mathematics, 51(3), 243-267.
[9]	Glover, F., (1977), Tabu Search, Kluwer Academic Publishers, Boston.
[10]	Huang, K.L. and Liao, C.J., (2008), "Ant colony optimization combined with tabu search for the job shop scheduling problem", Computers & Operations Research, 35(4), 1030-1046.
[11]	Ibaraki, T., Nomura, T. and Sasaki, M., (2008), "Integer programming approaches to the problem of network upgrading", The 2008 International Symposium on Applications and the Internet, 229-232.
[12]	Kelley, J.E., (1963), The critical path method: resources planning and scheduling, Prentice-Hall, Englewood Cliffs, New Jersey.
[13]	Minghe, S., (2006), "Solving the incapacitated facility location problem using tabu search", Computers & Operations Research, 33(9), 2563-2589.
[14]	Merkle, D., Middendorf, M. and Schmeck, H., (2002), "Ant colony for resource constrained project scheduling", IEEE Transactions on Evolutionary Computation, 6(4), 333-346.
[15]	Taillard, E., (1991), "Robust tabu search for the quadratic assignment problem", Parallel Computing, 17(4-5), 443-455.
[16]	Wang, J., (2005), "Constraint-based schedule repair for product development projects with time-limited constraints", International Journal of Production Economics, 95(3), 399-414.

Cite This Article

Plain Text BibTeX RIS

APA Style

Rong-Hwa Huang, Chang-Lin Yang. (2013). Robust Project Scheduling with Two Constrained Resources. Science Journal of Business and Management, 1(1), 19-25. https://doi.org/10.11648/j.sjbm.20130101.14

Copy | Download

ACS Style

Rong-Hwa Huang; Chang-Lin Yang. Robust Project Scheduling with Two Constrained Resources. Sci. J. Bus. Manag. 2013, 1(1), 19-25. doi: 10.11648/j.sjbm.20130101.14

Copy | Download

AMA Style

Rong-Hwa Huang, Chang-Lin Yang. Robust Project Scheduling with Two Constrained Resources. Sci J Bus Manag. 2013;1(1):19-25. doi: 10.11648/j.sjbm.20130101.14

Copy | Download

@article{10.11648/j.sjbm.20130101.14,
  author = {Rong-Hwa Huang and Chang-Lin Yang},
  title = {Robust Project Scheduling with Two Constrained Resources},
  journal = {Science Journal of Business and Management},
  volume = {1},
  number = {1},
  pages = {19-25},
  doi = {10.11648/j.sjbm.20130101.14},
  url = {https://doi.org/10.11648/j.sjbm.20130101.14},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sjbm.20130101.14},
  abstract = {Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack times. This study utilized a novel parallel tabu search scheme to simulate multiple CPUs searching for the optimum value. The parallel tabu search outperformed the conventional tabu search in terms of exploration. For model verification, test datasets from the project scheduling problem library (PSPLIB) were adopted. Analytical results show that parallel tabu search exceeded the conventional tabu search in optimizing the objective value.},
 year = {2013}
}

Copy | Download

TY  - JOUR
T1  - Robust Project Scheduling with Two Constrained Resources
AU  - Rong-Hwa Huang
AU  - Chang-Lin Yang
Y1  - 2013/06/30
PY  - 2013
N1  - https://doi.org/10.11648/j.sjbm.20130101.14
DO  - 10.11648/j.sjbm.20130101.14
T2  - Science Journal of Business and Management
JF  - Science Journal of Business and Management
JO  - Science Journal of Business and Management
SP  - 19
EP  - 25
PB  - Science Publishing Group
SN  - 2331-0634
UR  - https://doi.org/10.11648/j.sjbm.20130101.14
AB  - Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack times. This study utilized a novel parallel tabu search scheme to simulate multiple CPUs searching for the optimum value. The parallel tabu search outperformed the conventional tabu search in terms of exploration. For model verification, test datasets from the project scheduling problem library (PSPLIB) were adopted. Analytical results show that parallel tabu search exceeded the conventional tabu search in optimizing the objective value.
VL  - 1
IS  - 1
ER  -

Copy | Download

Author Information

Rong-Hwa Huang

Department of Business Administration, Fu Jen Catholic University, Taiwan
Chang-Lin Yang

Department of Business Administration, Fu Jen Catholic University, Taiwan

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Rong-Hwa Huang, Chang-Lin Yang. (2013). Robust Project Scheduling with Two Constrained Resources. Science Journal of Business and Management, 1(1), 19-25. https://doi.org/10.11648/j.sjbm.20130101.14

Copy | Download

ACS Style

Rong-Hwa Huang; Chang-Lin Yang. Robust Project Scheduling with Two Constrained Resources. Sci. J. Bus. Manag. 2013, 1(1), 19-25. doi: 10.11648/j.sjbm.20130101.14

Copy | Download

AMA Style

Rong-Hwa Huang, Chang-Lin Yang. Robust Project Scheduling with Two Constrained Resources. Sci J Bus Manag. 2013;1(1):19-25. doi: 10.11648/j.sjbm.20130101.14

Copy | Download

@article{10.11648/j.sjbm.20130101.14,
  author = {Rong-Hwa Huang and Chang-Lin Yang},
  title = {Robust Project Scheduling with Two Constrained Resources},
  journal = {Science Journal of Business and Management},
  volume = {1},
  number = {1},
  pages = {19-25},
  doi = {10.11648/j.sjbm.20130101.14},
  url = {https://doi.org/10.11648/j.sjbm.20130101.14},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.sjbm.20130101.14},
  abstract = {Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack times. This study utilized a novel parallel tabu search scheme to simulate multiple CPUs searching for the optimum value. The parallel tabu search outperformed the conventional tabu search in terms of exploration. For model verification, test datasets from the project scheduling problem library (PSPLIB) were adopted. Analytical results show that parallel tabu search exceeded the conventional tabu search in optimizing the objective value.},
 year = {2013}
}

Copy | Download

TY  - JOUR
T1  - Robust Project Scheduling with Two Constrained Resources
AU  - Rong-Hwa Huang
AU  - Chang-Lin Yang
Y1  - 2013/06/30
PY  - 2013
N1  - https://doi.org/10.11648/j.sjbm.20130101.14
DO  - 10.11648/j.sjbm.20130101.14
T2  - Science Journal of Business and Management
JF  - Science Journal of Business and Management
JO  - Science Journal of Business and Management
SP  - 19
EP  - 25
PB  - Science Publishing Group
SN  - 2331-0634
UR  - https://doi.org/10.11648/j.sjbm.20130101.14
AB  - Distinct from ordinary project scheduling to minimize project completion time, this study conducts robust project scheduling with two resources constraints. In this study, actual start time of each operation is dynamic. The latest finish time minus actual finish time is the slack time available to each operation. The objective of this study is to determine all project operation times and slack times. This study utilized a novel parallel tabu search scheme to simulate multiple CPUs searching for the optimum value. The parallel tabu search outperformed the conventional tabu search in terms of exploration. For model verification, test datasets from the project scheduling problem library (PSPLIB) were adopted. Analytical results show that parallel tabu search exceeded the conventional tabu search in optimizing the objective value.
VL  - 1
IS  - 1
ER  -

Copy | Download