A lower bound for the job insertion problem. (Q1811122): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu-search for the multi-mode job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-resource shop scheduling with resource flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling using neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective neighbourhood functions for the flexible job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the application of insertion techniques for job shop problems with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank

Latest revision as of 17:29, 5 June 2024

scientific article
Language Label Description Also known as
English
A lower bound for the job insertion problem.
scientific article

    Statements

    A lower bound for the job insertion problem. (English)
    0 references
    0 references
    0 references
    10 June 2003
    0 references
    0 references
    Job-shop scheduling
    0 references
    Perfect graphs
    0 references
    Polyhedral methods
    0 references