Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ejor.2005.06.067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065269629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental comparison of solution algorithms for the single-machine tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine, multi-criteria scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: One machine sequencing to minimize mean flow time with minimum number tardy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a scheduling problem with dual criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension of a result on scheduling with secondary criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of two dual criteria scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743969 / 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: The Single Machine Early/Tardy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Costs in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of late jobs in a stochastic setting using a chance constraint / rank
 
Normal rank

Latest revision as of 11:18, 25 June 2024

scientific article
Language Label Description Also known as
English
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
scientific article

    Statements

    Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    number of tardy jobs
    0 references
    maximum weighted tardiness
    0 references
    NP-hard
    0 references
    heuristics
    0 references
    0 references