The complexity of scheduling job families about a common due date (Q1376265): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126864231, #quickstatements; #temporary_batch_1719321775979
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
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: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / 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: New Bounds for the Identical Parallel Processor Weighted Flow Time Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on “Parallel Machine Scheduling with Batch Setup Times” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126864231 / rank
 
Normal rank

Latest revision as of 14:25, 25 June 2024

scientific article
Language Label Description Also known as
English
The complexity of scheduling job families about a common due date
scientific article

    Statements

    The complexity of scheduling job families about a common due date (English)
    0 references
    0 references
    17 December 1997
    0 references
    nonregular performance measure
    0 references
    family scheduling
    0 references
    setup time structure
    0 references
    parallel machines
    0 references
    common due-date
    0 references
    complexity results
    0 references
    total earliness/tardiness problem
    0 references

    Identifiers