scientific article
From MaRDI portal
Publication:3670909
zbMath0521.90061MaRDI QIDQ3670909
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitypolynomial time algorithmopen shopparallel machine problemsshop schedulingminimum makespanworst case performanceapproximative heuristicsmachine aggregation heuristics
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
A note on worst-case analysis of approximation algorithms for a scheduling problem, A neuro-tabu search heuristic for the flow shop scheduling problem, Tight approximations for resource constrained scheduling and bin packing, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, Using aggregation to reduce response time variability in cyclic fair sequences, Permutation vs. non-permutation flow shop schedules, Some new results in flow shop scheduling, An improved NEH heuristic to minimize makespan in permutation flow shops, How good is a dense shop schedule?, The museum visitor routing problem, Inapproximability results for no-wait job shop scheduling., The three-stage assembly flowshop scheduling problem, Scheduling algorithms for flexible flowshops: Worst and average case performance, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, An iterative improvement approach for the nonpreemptive open shop scheduling problem, A fast tabu search algorithm for the permutation flow-shop problem, A hybrid genetic algorithm for the open shop scheduling problem, Some results of the worst-case analysis for flow shop scheduling, Some aspects of scatter search in the flow-shop problem, A review of TSP based approaches for flowshop scheduling, Performance guarantees for flowshop heuristics to minimize makespan, Performance of scheduling algorithms for no-wait flowshops with parallel machines, Optimal control of a class of DEDS: Flow-shops with state-dependent processing times, A combination of flow shop scheduling and the shortest path problem
