An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
From MaRDI portal
Publication:2467260
DOI10.1016/J.EJOR.2006.07.029zbMATH Open1137.90514OpenAlexW1977133017MaRDI QIDQ2467260FDOQ2467260
Authors: Rubén Ruiz, Thomas Stützle 
Publication date: 21 January 2008
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.07.029
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
metaheuristicsflowshop schedulingmakespanstochastic local searchsequence dependent setup timesiterated greedyweighted tardiness
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- A survey of scheduling problems with setup times or costs
- Title not available (Why is that?)
- Stochastic local search. Foundations and applications.
- Scheduling in flowshops to minimize total tardiness of jobs
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- Record breaking optimization results using the ruin and recreate principle
- Benchmarks for basic scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Two models for a family of flowshop sequencing problems
- Note: A local-search heuristic for large set-covering problems
- The two-machine sequence dependent flowshop scheduling problem
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Heuristics for the flow line problem with setup costs
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
- The flow shop scheduling polyhedron with setup times
- Two MILP models for the N × M SDST flowshop sequencing problem
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
Cited In (63)
- Iterated greedy for the maximum diversity problem
- An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
- A two-stage solution approach for the directed rural postman problem with turn penalties
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- 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
- Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study
- Scheduling open shops with parallel machines to minimize total completion time
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- New hard benchmark for flowshop scheduling problems minimising makespan
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- Shifting representation search for hybrid flexible flowline problems
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- Algorithms for a realistic variant of flowshop scheduling
- A knowledge-based approach for multi-factory production systems
- 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
- A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
- Tabu search for min-max edge crossing in graphs
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Just-in-time scheduling for a distributed concrete precast flow shop system
- A variable depth neighborhood search algorithm for the min-max arc crossing problem
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- New efficient heuristics for scheduling open shops with makespan minimization
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Iterated greedy local search methods for unrelated parallel machine scheduling
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Local search methods for the flowshop scheduling problem with flowtime minimization
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- 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
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- 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
- Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
- An ALNS to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times
- Scheduling unrelated parallel machines with attribute-dependent setup times: a case study
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- 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
- A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time
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)
