A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033): 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 the average deviation of job completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of absolute lateness in single-machine and multimachine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean absolute deviation of completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming State-Space Relaxation for Single-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Early/Tardy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize mean absolute lateness: A heuristic solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with early and tardy completion costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a class of single-machine weighted tardiness and earliness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(99)00130-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013137873 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound approach for single machine scheduling with earliness and tardiness penalties
scientific article

    Statements

    A branch and bound approach for single machine scheduling with earliness and tardiness penalties (English)
    0 references
    0 references
    20 January 2000
    0 references
    branch and bound
    0 references
    complexity
    0 references
    single machine scheduling
    0 references

    Identifiers