Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2009.04.008 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990514741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling realistic hybrid flexible flowshop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative framework to Lagrangian relaxation approach for job shop scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate gradient algorithm for Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bundle methods for solving Lagrangian relaxation dual problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for total tardiness minimization in flowshop scheduling problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2009.04.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:28, 10 December 2024

scientific article
Language Label Description Also known as
English
Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
scientific article

    Statements

    Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    hybrid flowshop scheduling
    0 references
    Lagrangian relaxation
    0 references
    cut generation
    0 references
    dynamic programming
    0 references

    Identifiers