A note on reverse scheduling with maximum lateness objective (Q398863): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/scheduling/LiBNCSY13, #quickstatements; #temporary_batch_1731508824982
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990831559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse scheduling with maximum lateness objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for the maximum weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / 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: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/scheduling/LiBNCSY13 / rank
 
Normal rank

Latest revision as of 15:43, 13 November 2024

scientific article
Language Label Description Also known as
English
A note on reverse scheduling with maximum lateness objective
scientific article

    Statements

    Identifiers