A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
From MaRDI portal
Publication:954034
DOI10.1016/J.COR.2007.10.004zbMATH Open1157.90417OpenAlexW2086672027WikidataQ57633880 ScholiaQ57633880MaRDI QIDQ954034FDOQ954034
Authors: Jitti Jungwattanakit, Manop Reodecha, Paveena Chaovalitwongse, Frank Werner 
Publication date: 7 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.004
Recommendations
- Algorithms for a realistic variant of flowshop scheduling
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- A bicriteria flowshop scheduling problem with setup times
- Scheduling flexible flow lines with sequence-dependent setup times
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- Convergence of an annealing algorithm
- A survey of scheduling problems with setup times or costs
- A genetic algorithm for flowshop sequencing
- Two-Stage, Hybrid Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- An Evaluation of Flow Shop Sequencing Heuristics
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Title not available (Why is that?)
- A computational study of heuristics for two-stage flexible flowshops
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Branch and bound algorithm for the flow shop with multiple processors
- The flow shop with parallel machines: A tabu search approach
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Scheduling of flexible flow lines in an automobile assembly plant
- Operations scheduling with applications in manufacturing and services. With 3.5 disk package
Cited In (32)
- Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study
- A flexible job shop scheduling approach with operators for coal export terminals
- Title not available (Why is that?)
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- Title not available (Why is that?)
- Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry
- Modeling realistic hybrid flexible flowshop scheduling problems
- Title not available (Why is that?)
- The third comprehensive survey on scheduling problems with setup times/costs
- A discrete inter-species cuckoo search for flowshop scheduling problems
- Dynamic routing strategies for JIT production in hybrid flow shops
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- The hybrid flow shop scheduling problem
- Shifting representation search for hybrid flexible flowline problems
- Trade-off between time complexity and makespan for flexible flow-shop group scheduling problems with two machine centers
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- Algorithms for a realistic variant of flowshop scheduling
- Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Scheduling algorithms for a semiconductor probing facility
- Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A systematic review of multi-objective hybrid flow shop scheduling
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- An integrated approach for scheduling health care activities in a hospital
- Scheduling jobs on a \(k\)-stage flexible flow-shop
This page was built for publication: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954034)
