Flexible flow shop scheduling with uniform parallel machines
From MaRDI portal
Publication:2569085
DOI10.1016/j.ejor.2004.05.017zbMath1083.90022MaRDI QIDQ2569085
Kyparisis, George J., Christos P. Koulamas
Publication date: 17 October 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.05.017
scheduling; makespan; approximation algorithms; uniform machines; flexible flow shop; absolute performance guarantee
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
68W25: Approximation algorithms
Related Items
Control methods for dynamic time-based manufacturing under customized product lead times, Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises, Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, The hybrid flow shop scheduling problem, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
- On some geometric methods in scheduling theory: A survey
- Minimizing makespan in hybrid flowshops
- Scheduling on uniform parallel machines to minimize maximum lateness
- Assembly-Line Scheduling with Concurrent Operations and Parallel Machines
- Bounding algorithm for the routing problem with arbitrary paths and alternative servers
- Bounds for List Schedules on Uniform Processors
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- An Evaluation of Flow Shop Sequencing Heuristics
- Improved Approximation Algorithms for Shop Scheduling Problems
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Note on Heuristics of Flow-Shop Scheduling
