A time-indexed LP-based approach for min-sum job-shop problems (Q646647): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10479-010-0832-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994945816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Constraint Programming and Local Search for Job-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian bounds for just-in-time job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job shop scheduling problem: Conventional and new solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction problems: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact vs. exponential-size LP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative framework to Lagrangian relaxation approach for job shop scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An advanced tabu search algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for shop scheduling problems with minsum objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very fast TS/SA algorithm for the job shop scheduling problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:29, 4 July 2024

scientific article
Language Label Description Also known as
English
A time-indexed LP-based approach for min-sum job-shop problems
scientific article

    Statements

    A time-indexed LP-based approach for min-sum job-shop problems (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2011
    0 references
    0 references
    job-shop
    0 references
    flow-shop
    0 references
    total weighted completion time
    0 references
    time-indexed formulation
    0 references
    0 references
    0 references
    0 references