An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zi-Zhen Zhang / rank
Normal rank
 
Property / author
 
Property / author: Andrew E. B. Lim / rank
Normal rank
 
Property / author
 
Property / author: Zi-Zhen Zhang / rank
 
Normal rank
Property / author
 
Property / author: Andrew E. B. Lim / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1816779164 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.5869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Formulation with Diverse Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling in film production to minimize talent hold cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Talent Scheduling with Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple approximation algorithm for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of modern heuristic search methods to pattern sequencing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination of recursive calls using a small table of “randomly” selected function values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the talent scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two branch-and-bound algorithms for the robust parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction dynamic programming algorithm for the bi-objective integer knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caching Search States in Permutation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach / rank
 
Normal rank

Latest revision as of 17:06, 12 July 2024

scientific article
Language Label Description Also known as
English
An enhanced branch-and-bound algorithm for the talent scheduling problem
scientific article

    Statements

    An enhanced branch-and-bound algorithm for the talent scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    scheduling
    0 references
    talent scheduling
    0 references
    branch-and-bound
    0 references
    dynamic programming
    0 references
    dominance rules
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references