scientific article; zbMATH DE number 3825546

zbMATH Open0521.90061MaRDI QIDQ3670909FDOQ3670909

Authors: H. Rock, Günter Schmidt 

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexityopen shoppolynomial time algorithmshop schedulingminimum makespanworst case performanceparallel machine problemsapproximative heuristicsmachine aggregation heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (24)

• Tight approximations for resource constrained scheduling and bin packing
• Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
• Performance guarantees for flowshop heuristics to minimize makespan
• How good is a dense shop schedule?
• Some new results in flow shop scheduling
• Performance of scheduling algorithms for no-wait flowshops with parallel machines
• A review of TSP based approaches for flowshop scheduling
• No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• The museum visitor routing problem
• A neuro-tabu search heuristic for the flow shop scheduling problem
• A fast tabu search algorithm for the permutation flow-shop problem
• Using aggregation to reduce response time variability in cyclic fair sequences
• Inapproximability results for no-wait job shop scheduling.
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• A combination of flow shop scheduling and the shortest path problem
• Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• The three-stage assembly flowshop scheduling problem
• Some results of the worst-case analysis for flow shop scheduling
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Permutation vs. non-permutation flow shop schedules
• Some aspects of scatter search in the flow-shop problem
• A hybrid genetic algorithm for the open 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 Q3670909)