Minimizing late jobs in the general one machine scheduling problem (Q1130035): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Minimizing late jobs in the general one machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized due date scheduling problems / 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: Q3940839 / 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: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)00116-t / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086491340 / rank
 
Normal rank

Latest revision as of 08:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Minimizing late jobs in the general one machine scheduling problem
scientific article

    Statements

    Identifiers