A taxonomy of flexible flow line scheduling procedures
From MaRDI portal
Publication:859681
DOI10.1016/j.ejor.2006.01.042zbMath1163.90508OpenAlexW2029215259MaRDI QIDQ859681
Publication date: 16 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.042
Related Items
Scheduling semiconductor in-line steppers in new product/process introduction scenarios, A scatter search algorithm for the distributed permutation flowshop scheduling problem, Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines, Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, Dynamic routing strategies for JIT production in hybrid flow shops, A data intensive heuristic approach to the two-stage streaming scheduling problem, Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization, A systematic review of multi-objective hybrid flow shop scheduling, New heuristics for total tardiness minimization in a flexible flowshop, Batch-size-based rearrangement of the shop floor into mini-lines, Flexible job shop scheduling with blockages, A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations, The hybrid flow shop scheduling problem, A multi‐objective customer orders assignment and resource leveling in make‐to‐order manufacturing, Shifting representation search for hybrid flexible flowline problems, Hybrid flow shop with unrelated machines, setup time, and work in progress buffers for bi-objective optimization of tortilla manufacturing, Algorithms for a realistic variant of flowshop scheduling, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, A Taxonomy for the Flexible Job Shop Scheduling Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Branch and bound algorithm for the flow shop with multiple processors
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- Scheduling of flexible flow lines in an automobile assembly plant
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
- Branch and bound crossed with GA to solve hybrid flowshops
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Minimizing makespan in hybrid flowshops
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- The flow shop with parallel machines: A tabu search approach
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Heuristics for scheduling in a flow shop with multiple processors
- Scheduling flexible flow lines with sequence-dependent setup times
- Metaheuristics: A bibliography
- Routing and scheduling in a flexible job shop by tabu search
- Optimal two- and three-stage production schedules with setup times included
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Scheduling flexible flow lines with no in-process buffers
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
- An Exact Method for Solving the Multi-Processor Flow-Shop
- Simultaneous versus sequential loading and scheduling of flexible assembly systems
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- Conceptual framework for lot-sizing and scheduling of flexible flow lines
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A flexible flowshop problem with total flow time minimization
- Preemptive hybrid flowshop scheduling problem of interval orders
