Effective heuristics for the single machine sequencing problem with ready times (Q3352822): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207549108948029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025816555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem / rank
 
Normal rank

Latest revision as of 17:32, 21 June 2024

scientific article
Language Label Description Also known as
English
Effective heuristics for the single machine sequencing problem with ready times
scientific article

    Statements

    Effective heuristics for the single machine sequencing problem with ready times (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    single machine sequencing
    0 references
    different ready times
    0 references
    mean completion time
    0 references
    heuristics
    0 references
    branch and bound
    0 references
    0 references