An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

DOI10.1016/j.ejor.2006.07.029zbMath1137.90514OpenAlexW1977133017MaRDI QIDQ2467260

Thomas Stützle, Rubén Ruiz

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

zbMATH Keywords

metaheuristicsmakespanflowshop schedulingweighted tardinessstochastic local searchsequence dependent setup timesiterated greedy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (56)

New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints ⋮ 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 ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ Metaheuristics for the single machine weighted quadratic tardiness 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 knowledge-based approach for multi-factory production systems ⋮ Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Scheduling open shops with parallel machines to minimize total completion time ⋮ Just-in-time scheduling for a distributed concrete precast flow shop system ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates ⋮ 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 constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ A two-stage solution approach for the directed rural postman problem with turn penalties ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ 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 ⋮ Scheduling job shop problems with sequence-dependent setup times ⋮ New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry ⋮ Shifting representation search for hybrid flexible flowline problems ⋮ Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data ⋮ Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning ⋮ An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system ⋮ Tabu search for min-max edge crossing in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• The two-machine sequence dependent flowshop scheduling problem
• Heuristics for the flow line problem with setup costs
• Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• The flow shop scheduling polyhedron with setup times
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• A comprehensive review and evaluation of permutation flowshop heuristics
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
• Two models for a family of flowshop sequencing problems
• Record breaking optimization results using the ruin and recreate principle
• Benchmarks for basic scheduling problems
• A survey of scheduling problems with setup times or costs
• Two MILP models for the N × M SDST flowshop sequencing problem
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
• Scheduling in flowshops to minimize total tardiness of jobs
• Note: A local-search heuristic for large set-covering problems
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times

This page was built for publication: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives