Minimizing total tardiness on a single machine with controllable processing times (Q1000969): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LINGO / rank
 
Normal rank
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.cor.2008.05.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971584650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the single machine total weighted tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Total Tardiness Problem: Review and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with resource dependent release times and processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy / rank
 
Normal rank
Property / cites work
 
Property / cites work: General flow-shop scheduling with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling subject to deadlines and resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with discretely controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted flow time in a single machine with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine sequencing with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single machine scheduling problem with common due window and controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with a variable common due date and resource-dependent processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / 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: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of leading heuristics for the single machine tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for graph coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach for the one-machine mean tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flow shop scheduling problems / rank
 
Normal rank

Latest revision as of 01:10, 29 June 2024

scientific article
Language Label Description Also known as
English
Minimizing total tardiness on a single machine with controllable processing times
scientific article

    Statements

    Minimizing total tardiness on a single machine with controllable processing times (English)
    0 references
    0 references
    0 references
    0 references
    12 February 2009
    0 references
    controllable processing time
    0 references
    total tardiness
    0 references
    single-machine
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers