Hybrid flowshop scheduling with machine and resource-dependent processing times
From MaRDI portal
Publication:534872
DOI10.1016/j.apm.2010.07.057zbMath1211.90077MaRDI QIDQ534872
J. Behnamian, Seyyed Mohammad Taghi Fatemi Ghomi
Publication date: 10 May 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.07.057
multi-objective optimization; resource allocation; sequence-dependent setup times; hybrid metaheuristic; hybrid flowshop scheduling; machines with different speeds
90C29: Multi-objective and goal programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
The third comprehensive survey on scheduling problems with setup times/costs, Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption, Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics, Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic, Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates, Group-shop scheduling with sequence-dependent set-up and transportation times, Hybrid flexible flowshop problems: models and solution methods, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, Solving multi-objective parallel machine scheduling problem by a modified NSGA-II, A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations, Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics, Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques, Machine scheduling in production: a content analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Nonlinear multiobjective optimization
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- On min-norm and min-max methods of multi-objective optimization
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
- Heuristic for a new multiobjective scheduling problem
- Group technology in a hybrid flowshop environment: a case study
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- A flexible flowshop problem with total flow time minimization
