No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00186-005-0056-y / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00186-005-0056-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053571513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for no-wait flowshops to minimize makespan. / 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: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for 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: A branch and bound algorithm for 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: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / 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: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion / 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: 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: A rollout metaheuristic for job shop scheduling problems / 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: Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search method guided by shifting bottleneck for the job shop scheduling problem / 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: Q3585709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative procedures for no-wait job shop scheduling. / 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: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for no-wait job shop scheduling. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00186-005-0056-Y / rank
 
Normal rank

Latest revision as of 21:01, 18 December 2024

scientific article
Language Label Description Also known as
English
No-wait job shop scheduling: tabu search and complexity of subproblems
scientific article

    Statements

    No-wait job shop scheduling: tabu search and complexity of subproblems (English)
    0 references
    6 March 2008
    0 references
    Scheduling
    0 references
    job shop
    0 references
    no-wait
    0 references
    decomposition
    0 references
    complexity
    0 references
    tabu search
    0 references
    flow shop
    0 references
    0 references
    0 references
    0 references

    Identifiers