Scheduling flexible flow lines with sequence-dependent setup times
From MaRDI portal
Publication:1876159
DOI10.1016/S0377-2217(03)00401-6zbMath1067.90045OpenAlexW1970329178MaRDI QIDQ1876159
Publication date: 16 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00401-6
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis, Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, Hybrid flexible flowshop problems: models and solution methods, Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A taxonomy of flexible flow line scheduling procedures, Scheduling parallel-machine batch operations to maximize on-time delivery performance, Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times, Scheduling open shops with parallel machines to minimize total completion time, A study on open shop scheduling to minimise total tardiness, Control methods for dynamic time-based manufacturing under customized product lead times, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times, Modeling realistic hybrid flexible flowshop scheduling problems, A survey of scheduling problems with setup times or costs, A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Heuristics for periodical batch job scheduling in a MapReduce computing framework, A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation, The hybrid flow shop scheduling problem, An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns, Scheduling job shop problems with sequence-dependent setup times, Capacity-filtering algorithms for finite-capacity planning of a flexible flow line, A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility, Shifting representation search for hybrid flexible flowline problems, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, Order acceptance using genetic algorithms, Algorithms for a realistic variant of flowshop scheduling, Conceptual framework for lot-sizing and scheduling of flexible flow lines, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, A hybrid method for large-scale short-term scheduling of make-and-pack production processes
Cites Work
- 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 fast tabu search algorithm for the permutation flow-shop problem
- Scheduling of flexible flow lines in an automobile assembly plant
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times
- Minimizing makespan in hybrid flowshops
- Two-stage flowshop scheduling with a common second-stage machine
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- The flow shop with parallel machines: A tabu search approach
- Heuristics for scheduling in a flow shop with multiple processors
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- Optimal two- and three-stage production schedules with setup times included
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A genetic algorithm methodology for complex scheduling problems
- A flowshop scheduling problem with two operations per job
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Scheduling flexible flow lines with no in-process buffers
- FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
