Approximative procedures for no-wait job shop scheduling. (Q1413924): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362834424
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing of jobs in some production system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of job-shop problems to flow-shop problems with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Numerical Experiments for an <i>M</i> × <i>J</i> Flow Shop and its Decision-Theoretical Aspects / 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: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and optimization of industrial manufacturing processes subject to no-wait constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with blocking and no-wait constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scheduling Problem<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Shops with No Wait in Process / 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: An effective hybrid optimization strategy for job-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank

Latest revision as of 12:37, 6 June 2024

scientific article
Language Label Description Also known as
English
Approximative procedures for no-wait job shop scheduling.
scientific article

    Statements

    Approximative procedures for no-wait job shop scheduling. (English)
    0 references
    0 references
    0 references
    17 November 2003
    0 references
    0 references
    Scheduling
    0 references
    Job shop
    0 references
    No-wait
    0 references
    Decomposition
    0 references
    Local search
    0 references
    Flow shop
    0 references