NDLI: Branch-and-bound style resource constrained scheduling using efficient structure-aware pruning

Content Provider	IEEE Xplore Digital Library
Author	Mingsong Chen Saijie Huang Geguang Pu Mishra, P.
Copyright Year	2013
Description	Author affiliation: Shanghai Key Lab. of Trustworthy Comput., East China Normal Univ., Shanghai, China (Mingsong Chen; Saijie Huang; Geguang Pu) \|\| Comput. & Inf. Sci. & & Eng., Univ. of Florida, Gainesville, FL, USA (Mishra, P.)
Abstract	Branch-and-bound approaches are promising in pruning infeasible search space during the resource constrained scheduling (RCS). However, such methods only compare the estimated upper and lower bounds of an incomplete schedule to the length of the best feasible schedule at that iteration. This paper proposes an efficient pruning technique which can identify the fruitless search space based on the detailed structural scheduling information of the obtained best feasible schedule. The proactive nature of our pruning technique enables the pruning of the space which cannot be identified by the state-of-the-art branch-and-bound techniques. The experimental results demonstrate that our approach can drastically (up to two orders-of-magnitude) reduce the overall RCS time under a wide variety of resource constraints.
Starting Page	224
Ending Page	229
File Size	604095
Page Count	6
File Format	PDF
ISBN	9781479913312
ISSN	21593469
DOI	10.1109/ISVLSI.2013.6654637
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-08-05
Publisher Place	Brazil
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Schedules Optimal scheduling Scheduling Processor scheduling Dispatching Benchmark testing Estimation
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

Efficient Two-Phase Approaches for Branch-and-Bound Style Resource Constrained Scheduling

Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Branch and bound algorithm in optimizing job shop scheduling problems

A new benchmark dataset for Multi-Skill Resource-Constrained Project Scheduling Problem

A serial scheme for minimizing the duration of resource-constrained projects within Microsoft Project

Branch and price for Preemptive Resource Constrained Project Scheduling Problem based on interval orders in precedence graphs

Locality-Aware Reduce Task Scheduling for MapReduce

Priority list sensor scheduling using optimal pruning

Branch-and-bound style resource constrained scheduling using efficient structure-aware pruning

Similar Documents

Efficient Two-Phase Approaches for Branch-and-Bound Style Resource Constrained Scheduling

Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Branch and bound algorithm in optimizing job shop scheduling problems

A new benchmark dataset for Multi-Skill Resource-Constrained Project Scheduling Problem

A serial scheme for minimizing the duration of resource-constrained projects within Microsoft Project

Branch and price for Preemptive Resource Constrained Project Scheduling Problem based on interval orders in precedence graphs

Locality-Aware Reduce Task Scheduling for MapReduce

Priority list sensor scheduling using optimal pruning

Branch-and-bound style resource constrained scheduling using efficient structure-aware pruning