The prize-collecting scheduling problem with deadlines (Q510929): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2016.10.015 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6684439 / rank
 
Normal rank
Property / zbMATH Keywords
 
single machine scheduling
Property / zbMATH Keywords: single machine scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
total tardiness
Property / zbMATH Keywords: total tardiness / rank
 
Normal rank
Property / zbMATH Keywords
 
integer linear programming
Property / zbMATH Keywords: integer linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
hard deadlines
Property / zbMATH Keywords: hard deadlines / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and bound
Property / zbMATH Keywords: branch and bound / rank
 
Normal rank
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.endm.2016.10.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2549642359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Pareto-optima for the total and maximum tardiness single machine problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2016.10.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:53, 9 December 2024

scientific article
Language Label Description Also known as
English
The prize-collecting scheduling problem with deadlines
scientific article

    Statements

    The prize-collecting scheduling problem with deadlines (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    single machine scheduling
    0 references
    total tardiness
    0 references
    integer linear programming
    0 references
    hard deadlines
    0 references
    branch and bound
    0 references

    Identifiers

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