Abstract
A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availability is not continuous and described by a resource calendar, to be used to accomplish the jobs. Further the scheduling must be optimum and must comply various constraints. The proposed model is a typical binary integer programming problem for the scheduling problem subject to various constraints and hence it could be solved using the techniques of binary integer programming. One heuristic method is also discussed to solve the scheduling problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albers, S., Schmidt, G.: Scheduling with unexpected machine breakdowns. Discret. Appl. Math. 110, 85–99 (2001)
Schmidt, G.: Scheduling with limited machine availability. Eur. J. Oper. Res. 121, 1–15 (2000)
Taha, H.A.: Operations Research: An Introduction. Pearson Education, New Jersey (2007)
Engineer support plan. http://www.wikileaks.org/wiki/Engineer_support_plan
Acknowledgments
The authors would like to thank Mrs. Laxmi D, Sr.Engineer, Bharat Electronics Limited and Mr. Ganesh A, Member Research Staff, Central Research Laboratory, Bharat Electronics Ltd for their assistance in understanding the constraints of the problem. The authors also thank the management of Central Research Laboratory, Bharat Electronics Limited for their support and encouragement to carry out this work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yellapu, G., Penmetsa, S.K. Modeling of a scheduling problem with expected availability of resources. OPSEARCH 52, 771–781 (2015). https://doi.org/10.1007/s12597-015-0203-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12597-015-0203-z