NDLI: A Branch and Cut Algorithm for Resource-Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Pre-Scheduled Procurement

Content Provider	Springer Nature Link
Author	Shirzadeh Chaleshtarti, Ali Shadrokh, Shahram
Copyright Year	2014
Abstract	In the project scheduling literature, nonrenewable resources are assumed to be available in full amount at the beginning of the project. However, in practice, it is very common that these resources are procured along the project horizon according to some pre-scheduled plan. In this paper, we study an extended form of the resource-constrained project scheduling problem that is subject to this type of nonrenewable resources in addition to the renewable resources. In order to solve this problem, we propose a branch and cut algorithm. We incorporate with the algorithm some technics and fathoming rules to shorten the solving process. The algorithm is capable of specifying lower bounds for the problem in any middle stage of the solving process. The lower bounds can be useful to deal with large instances, for which the solving processes may be too long. We point out parameters affecting the degree of difficulty of the problem, generate extensive sets of sample instances for the problem, and perform comprehensive experimental analysis using our algorithm and also CPLEX solver. We analyze the algorithm behavior respect to the changes in instances degree of difficulties and compare its performances in different cases with the CPLEX solver.
Starting Page	8359
Ending Page	8369
Page Count	11
File Format	PDF
ISSN	13198025
Journal	Arabian Journal for Science and Engineering
Volume Number	39
Issue Number	11
e-ISSN	21914281
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2014-08-25
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Project scheduling Resource constraints Nonrenewable resources with prescheduled procurement Branch and cut Engineering Science
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

A Branch and Bound Algorithm for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

Efficient genetic algorithm for resource-constrained project scheduling problem

Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

A branch-and-bound algorithm for the resource-constrained project scheduling problem

Improved and competitive algorithms for large scale multiple resource-constrained project-scheduling problems

Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources

Local search for nonpreemptive multi-mode resource-constrained project scheduling

Project scheduling under partially renewable resource constraints

A Branch and Cut Algorithm for Resource-Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Pre-Scheduled Procurement

Similar Documents

Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

A Branch and Bound Algorithm for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

Efficient genetic algorithm for resource-constrained project scheduling problem

Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources

A branch-and-bound algorithm for the resource-constrained project scheduling problem

Improved and competitive algorithms for large scale multiple resource-constrained project-scheduling problems

Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources

Local search for nonpreemptive multi-mode resource-constrained project scheduling

Project scheduling under partially renewable resource constraints

A Branch and Cut Algorithm for Resource-Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Pre-Scheduled Procurement