A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates (Q1956018): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 16:30, 1 February 2024

scientific article
Language Label Description Also known as
English
A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
scientific article

    Statements

    A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates (English)
    0 references
    0 references
    13 June 2013
    0 references
    Summary: We consider a parallel machine scheduling problem with random processing/setup times and adjustable production rates. The objective functions to be minimized consist of two parts; the first part is related with the due date performance (i.e., the tardiness of the jobs), while the second part is related with the setting of machine speeds. Therefore, the decision variables include both the production schedule (sequences of jobs) and the production rate of each machine. The optimization process, however, is significantly complicated by the stochastic factors in the manufacturing system. To address the difficulty, a simulation-based three-stage optimization framework is presented in this paper for high-quality robust solutions to the integrated scheduling problem. The first stage (crude optimization) is featured by the ordinal optimization theory, the second stage (finer optimization) is implemented with a metaheuristic called differential evolution, and the third stage (fine-tuning) is characterized by a perturbation-based local search. Finally, computational experiments are conducted to verify the effectiveness of the proposed approach. Sensitivity analysis and practical implications are also discussed.
    0 references

    Identifiers