| Download | - View accepted manuscript: Constraint-based winner determination for auction-based scheduling (PDF, 916 KiB)
|
|---|
| DOI | Resolve DOI: https://doi.org/10.1109/TSMCA.2009.2013194 |
|---|
| Author | Search for: Wang, C.; Search for: Ghenniwa, H.; Search for: Shen, W.1 |
|---|
| Affiliation | - National Research Council of Canada. NRC Institute for Research in Construction
|
|---|
| Format | Text, Article |
|---|
| Abstract | This paper presents a formulation and an algorithm for the winner determination problem in auction-based scheduling. Without imposing a time line discretization, the proposed approach allows bidders to bid for the processing of a set of jobs under scheduling constraints using a requirement-based bidding language. The proposed winner determination algorithm uses a depth first branch and bound search. The search branches on bids and a constraint directed scheduling procedure is used at each node to verify the feasibility of the temporary schedule. The performance of the proposed algorithm is evaluated through experiments versus a set of auction-based scheduling winner determination problems generated based on a suite of job shop constraint satisfaction benchmark problems from the literature. Experimental results show that the proposed algorithm is on average more than an order of magnitude faster than the commercial optimization package CPLEX 10.0 over the tested problem sets. |
|---|
| Publication date | 2009-05-01 |
|---|
| In | |
|---|
| Language | English |
|---|
| Peer reviewed | Yes |
|---|
| NRC number | NRCC 50313
NRC-IRC-19533 |
|---|
| NPARC number | 20377703 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | 2b69f79c-187e-497a-aea1-0185ae8f6a5e |
|---|
| Record created | 2012-07-24 |
|---|
| Record modified | 2020-04-16 |
|---|
