Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics

DOI10.1016/j.ejor.2004.01.022zbMath1112.90338OpenAlexW2068003474MaRDI QIDQ1776952

Javier Alcaraz, Concepción Maroto, Rubén Ruiz

Publication date: 12 May 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.01.022

zbMATH Keywords

schedulinggenetic algorithmslocal searchsequence dependent setup times

Mathematics Subject Classification ID

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

Related Items

An adaptive scheduling algorithm for a parallel machine problem with rework processes, Distributionally robust single machine scheduling with the total tardiness criterion, An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints, Scheduling open shops with parallel machines to minimize total completion time, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, Minimizing the machine processing time in a flow shop scheduling problem under piecewise quadratic fuzzy numbers, Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry), A study on open shop scheduling to minimise total tardiness, A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times, Bi-criteria assembly line balancing by considering flexible operation times, Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times, Modeling realistic hybrid flexible flowshop scheduling problems, General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach, A survey of scheduling problems with setup times or costs, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness, Scheduling blocking flowshops with setup times via constraint guided and accelerated local search, Scheduling job shop problems with sequence-dependent setup times, Order acceptance using genetic algorithms, Algorithms for a realistic variant of flowshop scheduling, Flowshop scheduling research after five decades, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• The two-machine sequence dependent flowshop scheduling problem
• A new heuristic method for the flow shop sequencing problem
• Heuristics for the flow line problem with setup costs
• A genetic algorithm for flowshop sequencing
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• New heuristics for no-wait flowshops to minimize makespan.
• A comprehensive review and evaluation of permutation flowshop heuristics
• An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
• Benchmarks for basic scheduling problems
• Two MILP models for the N × M SDST flowshop sequencing problem
• Optimal two- and three-stage production schedules with setup times included
• 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
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Survey of scheduling research involving setup times
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A robust genetic algorithm for resource allocation in project scheduling