scientific article; zbMATH DE number 5774288

MaRDI QIDQ3585709zbMATH OpenFDO

Authors Jörg Schuster

Publication date 23 August 2010

Full work available at URL http://duepublico.uni-duisburg-essen.de/go/duett-04242003-131618

zbMATH Keywords

SequencingTimetabling

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• No-wait job shop scheduling: tabu search and complexity of subproblems
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• No-wait shop scheduling: Computational complexity and approximate algorithms
• Inapproximability results for no-wait job shop scheduling.
• Approximative procedures for no-wait job shop scheduling.
• scientific article; zbMATH DE number 1031416
• scientific article; zbMATH DE number 805284
• Some no-wait shops scheduling problems: Complexity aspect
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• Job-shop scheduling: Computational study of local search and large-step optimization methods

Cited in

(6)

• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• No-wait shop scheduling: Computational complexity and approximate algorithms
• Approximative procedures for no-wait job shop scheduling.
• No-wait job shop scheduling: tabu search and complexity of subproblems
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• A tabu search algorithm for no-wait job shop scheduling problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585709)