Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Laureano Fernando Escudero Bueno / rank
Normal rank
 
Property / author
 
Property / author: Anna Sciomachen / rank
Normal rank
 
Property / author
 
Property / author: Laureano Fernando Escudero Bueno / rank
 
Normal rank
Property / author
 
Property / author: Anna Sciomachen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single facility multi-class job scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling Polyhedra with Precedence Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:05, 22 May 2024

scientific article
Language Label Description Also known as
English
Local search procedures for improving feasible solutions to the sequential ordering problem
scientific article

    Statements

    Local search procedures for improving feasible solutions to the sequential ordering problem (English)
    0 references
    0 references
    21 March 1994
    0 references
    0 references
    sequential ordering problem
    0 references
    Hamiltonian path
    0 references
    release date
    0 references
    deadline
    0 references
    precedence relationships
    0 references
    makespan
    0 references
    approximation algorithm
    0 references