A model and procedure for competitive bidding under resource constraints

International Journal of Operational Research

Volumn 2, Issue 4, 2007, Pages 452-480

  Li, Haitao ^a   Womer, Keith ^b  

^a TROY UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Competitive bidding; Flexible job shop; General temporal constraints; Scheduling; Tabu search; Total weighted tardiness; TS

Indexed keywords

EID: 34848914805     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2007.014174     Document Type: Article

References (48)

1. Ahmad, I. and Minkarch, I. (1987) 'Optimum markup for bidding, a preference-uncertainty tradeoff approach', Civil Engineering Systems, Vol. 4, pp.170-174.
2. Alvarez-Valdes, R. and Tamarit, J.M. (1989) 'Heuristic algorithms for a resource-constrained project scheduling: a review and an empirical analysis', in Slowinski, R. and Weglarz (Eds.): Advances in Project Scheduling, Elsevier, Amsterdam, pp.113-134.
3. Avci, S., Akturk, M.S. and Storer, R.H. (2003) 'A problem space algorithm for single machine weighted tardiness problems', IIE Transactions, Vol. 35, No. 5, pp.479-486.
4. Baar, T., Brucker, P. and Knust, S. (1998) 'Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem', in Voss, S., Martello, S., Osman, I. and Roucairol, C. (Eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, pp.1-18.
5. Brucker, P. (2001) Scheduling Algorithms, Springer-Verlag, Berlin.
6. Brucker, P. (2002) 'Scheduling and constraint propagation', Discrete Applied Mathematics, Vol. 123, Nos. 1-3, pp.227-256.
7. Brucker, P. and Knust, S. (2000) 'A linear programming and constraint propagation-based lower bound for the RCPSP', European Journal of Operational Research, Vol. 127, No. 2, pp.335-362.
8. Brucker, P., Drexl, A., Mohring, R.H., Neemann, K. and Pesch, E. (1999) 'Resource-constrained project scheduling: notation, classification, models and methods', European Journal of Operational Research, Vol. 112, No. 1, pp.3-41.
9. Congram, R.K., Potts, C.N. and van de Velde, S.L. (2002) 'An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem', INFORMS Journal on Computing, Vol. 14, No. 1, pp.52-67.
10. Crauwels, H.A.J., Potts, C.N. and van Wassenhove, L.N. (1998) 'Local search heuristics for the single machine total weighted tardiness scheduling problem', INFORMS Journal on Computing, Vol. 10, No. 3, pp.341-350.
11. de Bontridder, K.M.J. (2005) 'Minimizing total weighted tardiness in a generalized job shop', Journal of Scheduling, Vol. 8, No. 6, pp.479-496.
12. Dell'amico, M. and Trubian, M. (1993) 'Applying tabu search to the job-shop scheduling problem', Annals of Operations Research, Vol. 41, No. 3, pp.231-252.
13. Franck, B. and Neumann, K. (1997) Resource-Constrained Project Scheduling with Time Windows: Structural Questions and Priority Rule Methods, Technical Report WIOR-450, University Karlsruhe, Germany.
14. Friedman, L. (1956) 'A competitive bidding strategy', Operations Research, Vol. 4, No. 1, pp.104-112.
15. Gallien, J. and Wein, L.M. (2005) 'A smart market for industrial procurement with capacity constraints', Management Science, Vol. 51, No. 1, pp.76-91.
16. Glover, F. (1989) 'Tabu search - Part I', ORSA Journal on Computing, Vol. 1, No. 3, pp.190-206.
17. Glover, F. (1990) 'Tabu search - Part II', ORSA Journal on Computing, Vol. 2, No. 1, pp.4-32.
18. Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic Publishers, Boston.
19. Hanssmann, F. and Rivett, B.H.P. (1959) 'Competitive bidding', Operations Research Quarterly, Vol. 10, No. 1, pp.49-55.
20. Herroelen, W., Demeulemeester, E. and de Reyck, B. (1998) 'Resource-constrained project scheduling - a survey of recent developments', Computers and Operations Research, Vol. 25, No. 4, pp.279-302.
21. Hubscher, R. and Glover, F. (1994) 'Applying tabu search with influential diversification to multiprocessor scheduling', Computers and Operations Research, Vol. 21, No. 8, pp.877-884.
22. ILOG (2003) ILOG CPLEX 9.0 User's Manual, ILOG Inc.
23. Kelly, J. (1961) 'Critical-path planning and scheduling: mathematical basis', Operations Research, Vol. 9, No. 3, pp.296-320.
24. King, M. and Mercer, A. (1991) 'Distributions in competitive bidding', Journal of Operational Research Society, Vol. 42, No. 2, pp.151-155.
25. Kolisch, R. (1996) 'Efficient priority rules for the resource-constrained project scheduling problem', Journal of Operations Management, Vol. 14, No. 3, pp.179-192.
26. Lawler, E.L. (1977) 'A 'pseudopolynomial' time algorithm for sequencing jobs to minimize total tardiness', Annals of Discrete Mathematics, Vol. 1, pp.331-342.
27. Lawrence, S.R. and Morton, T.E. (1993) 'Resource-constrained multi-project scheduling with tardy costs: comparing myopic, bottleneck, and resource pricing heuristics', European Journal of Operational Research, Vol. 64, No. 2, pp.168-187.
28. Leon, V.J. and Balakrishnan, R. (1995) 'Strength and adaptibility of problem-space based neighborhoods for resource-constrained scheduling', OR Spectrum, Vol. 17, pp.173-182.
29. Malcolm, D.G., Roseboom, J.H., Clark, C.E. and Fazar, W. (1959) 'Applications of a technique for research and development program evaluation', Operations Research, Vol. 7, No. 5, pp.646-669.
30. Milgrom, P. (1989) 'Auction and bidding: a primer', Journal of Economic Perspectives, Vol. 3, No. 3, pp.3-22.
31. Milgrom, P. and Weber, R. (1982) 'The value of information in a sealed-bid auction', Journal of Mathematical Economics, Vol. 10, pp.105-114.
32. Naykki, P. (1976) 'On optimal bidding strategies', Management Science, Vol. 23, No. 2, pp.198-203.
33. Neumann, K., Schwindt, C. and Zimmermann, J. (2002) Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-constrained Project Scheduling with Regular and Nonregular Objective Functions, Springer, New York.
34. Neumann, K., Schwindt, C. and Zimmermann, J. (2003) 'Order-based neighborhoods for project scheduling with nonregular objective functions', European Journal of Operational Research, Vol. 149, No. 2, pp.325-343.
35. Pinedo, M. (1995) Scheduling - Theory, A1gorithms and Systems, Prentice-Hall, New Jersey.
36. Pinedo, M. and Singer, M. (1999) 'A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop', Naval Research Logistic, Vol. 46, No. 1, pp.1-12.
37. Potts, C.N. and van Wassenhove, L.N. (1982) 'A decomposition algorithm for the single machine total tardiness problem', Operations Research Letters, Vol. 1, No. 5, pp.177-181.
38. Potts, C.N. and van Wassenhove, L.N. (1991) 'Single machine tardiness sequencing heuristics', IIE Transactions, Vol. 23, No. 4, pp.346-354.
39. Rothkopf, M. (1980) 'On multiplicative bidding strategies', Operations Research, Vol. 28, No. 3, pp.570-575.
40. Schwindt, C. (1996) Generation of Resource-constrained Project Scheduling Problems with Minimal and Maximal Time Lags, Technical Report WIOR-489, Institute für Wirtschaftstheorie und Operations Research, University of Karlsruhe, Karlsruhe, Germany.
41. Singer, J.I. (2002) 'Double auctions across a constrained transmission line', Operations Research, Vol. 50, No. 3, pp.449-461.
42. Skitmore, M. and Pemberton, J. (1994) 'A multivariate approach to construction contract bidding mark-up strategies', Journal of the Operational Research Society, Vol. 45, No. 11, pp.1263-1272.
43. Slowinski, R. (1981) 'Multobjective network scheduling with efficient use of renewable and nonrenewable resources', European Journal of Operational Research, Vol. 7, No. 3, pp.264-273.
44. Sprecher, A. (1994) Resource Constrained Project Scheduling: Exact Methods for the Multi-mode Case, Springer-Verlag, Berlin.
45. Stark, R. and Mayer, R. (1971) 'Some multi-contract decision theoretic competitive bidding models', Operations Research, Vol. 19, No. 2, pp.469-483.
46. Triki, C., Beraldi, P. and Gross, G. (2005) 'Optimal capacity allocation in multi-auction electricity markets under uncertainty', Computers and Operations Research, Vol. 32, No. 2, pp.201-217.
47. Vepsalainen, V. and Morton, T.E. (1987) 'Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs', Management Science, Vol. 33, No. 8, pp.1036-1047.
48. Weglarz, J. (1981) 'On certain models of resource allocation problems', Kybernetics, Vol. 9, pp.61-66.