Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (Q2203602): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.ipl.2020.106009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3045331303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot scheduling on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine lot scheduling to minimize the total weighted (discounted) completion time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:34, 23 July 2024

scientific article
Language Label Description Also known as
English
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
scientific article

    Statements

    Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2020
    0 references
    scheduling
    0 references
    lot scheduling
    0 references
    single machine
    0 references
    number of tardy orders
    0 references
    dynamic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references