Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Minimizing the makespan for the flow shop scheduling problem with availability constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and scheduling in a flexible job shop by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / 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: Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling / 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: Minimizing total weighted tardiness in a generalized job shop / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with processing alternatives. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large step random walk for minimizing total weighted tardiness in a job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for minimizing total weighted tardiness in complex job shops / 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: New single machine and job-shop scheduling problems with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops / 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: The flow shop with parallel machines: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of heuristic solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for large job shops / 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: Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times / rank
 
Normal rank

Revision as of 10:46, 1 July 2024

scientific article
Language Label Description Also known as
English
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
scientific article

    Statements

    Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2009
    0 references
    scheduling
    0 references
    batching
    0 references
    tabu search
    0 references
    mathematical programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers