An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019): 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.1016/j.cor.2004.09.009 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.09.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033755244 / 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: A Scheduling Problem<sup>*</sup> / 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: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan / 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: Computational Complexity of Discrete Optimization Problems / 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: Deterministic job-shop scheduling: Past, present and future / 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: A new approach to computing optimal schedules for the job-shop scheduling problem / 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: A Fast Taboo Search Algorithm for the Job Shop Problem / 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: Job-shop scheduling with blocking and no-wait constraints / 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: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing / 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: An effective hybrid optimization strategy for job-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3585709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / 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: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2004.09.009 / rank
 
Normal rank

Latest revision as of 01:09, 19 December 2024

scientific article
Language Label Description Also known as
English
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
scientific article

    Statements

    An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (English)
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    0 references
    0 references

    Identifiers