An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
From MaRDI portal
Publication:2467260
Recommendations
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- A comprehensive review and evaluation of permutation flowshop heuristics
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A survey of scheduling problems with setup times or costs
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- Heuristics for the flow line problem with setup costs
- Note: A local-search heuristic for large set-covering problems
- Record breaking optimization results using the ruin and recreate principle
- Scheduling in flowshops to minimize total tardiness of jobs
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Some efficient heuristic methods for the flow shop sequencing problem
- Stochastic local search. Foundations and applications.
- The flow shop scheduling polyhedron with setup times
- The two-machine sequence dependent flowshop scheduling problem
- Two MILP models for the N × M SDST flowshop sequencing problem
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- Two models for a family of flowshop sequencing problems
Cited in
(66)- Just-in-time scheduling for a distributed concrete precast flow shop system
- A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- Scheduling job shop problems with sequence-dependent setup times
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study
- A two-stage solution approach for the directed rural postman problem with turn penalties
- 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
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- New efficient heuristics for scheduling open shops with makespan minimization
- Iterated greedy for the maximum diversity problem
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- Scheduling open shops with parallel machines to minimize total completion time
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
- Iterated greedy local search methods for unrelated parallel machine scheduling
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
- Algorithms for a realistic variant of flowshop scheduling
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- A high performing metaheuristic for multi-objective flowshop scheduling problem
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- Shifting representation search for hybrid flexible flowline problems
- Tabu search for min-max edge crossing in graphs
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- New hard benchmark for flowshop scheduling problems minimising makespan
- Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- A knowledge-based approach for multi-factory production systems
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- A variable depth neighborhood search algorithm for the min-max arc crossing problem
- An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time
- Scheduling unrelated parallel machines with attribute-dependent setup times: a case study
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
- Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
This page was built for publication: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467260)
