A model and procedure for competitive bidding under resource constraints (Q2474696)

From MaRDI portal
Revision as of 10:13, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A model and procedure for competitive bidding under resource constraints
scientific article

    Statements

    A model and procedure for competitive bidding under resource constraints (English)
    0 references
    0 references
    0 references
    6 March 2008
    0 references
    Summary: Accurate cost estimates for an incoming order are critical in formulating the optimal bidding strategy. When a firm is approaching its resource capacity, adding a new job into the system in the short-run may cause violations of the due date requirements, thus penalty costs arise. Failure to obtain an accurate estimate of the penalty costs often leads to sub-optimal bids. In this paper, we propose a two-stage model and procedure for optimal bidding under explicit resource constraints. The computational results indicate that our model and solution approach is both effective and efficient for the proposed problem.
    0 references
    scheduling
    0 references
    total weighted tardiness
    0 references
    flexible job shop
    0 references
    general temporal constraints
    0 references
    competitive bidding
    0 references
    tabu search
    0 references
    TS
    0 references

    Identifiers