A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling (Q1885984): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / 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: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Algorithm for Decision CPM Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete time-cost tradeoff problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective approach to resource allocation in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms and tabu search: Hybrids for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of a simple scheduling polyhedron / rank
 
Normal rank

Latest revision as of 15:14, 7 June 2024

scientific article
Language Label Description Also known as
English
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
scientific article

    Statements