scientific article; zbMATH DE number 3825546
From MaRDI portal
Publication:3670909
Cited in
(23)- Using aggregation to reduce response time variability in cyclic fair sequences
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- Performance guarantees for flowshop heuristics to minimize makespan
- The three-stage assembly flowshop scheduling problem
- Some aspects of scatter search in the flow-shop problem
- A neuro-tabu search heuristic for the flow shop scheduling problem
- Tight approximations for resource constrained scheduling and bin packing
- Some results of the worst-case analysis for flow shop scheduling
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Inapproximability results for no-wait job shop scheduling.
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- A fast tabu search algorithm for the permutation flow-shop problem
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- A review of TSP based approaches for flowshop scheduling
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- The museum visitor routing problem
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- 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
- Permutation vs. non-permutation flow shop schedules
- Some new results in flow shop scheduling
- A hybrid genetic algorithm for the open shop scheduling problem
- How good is a dense shop schedule?
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)
