Scheduling in a sequence dependent setup environment with genetic search

DOI10.1016/0305-0548(93)E0021-KzbMath0813.90065OpenAlexW2001786211MaRDI QIDQ1342322

Gary L. Ragatz, Paul A. Rubin

Publication date: 13 February 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)e0021-k

zbMATH Keywords

genetic searchtotal tardinesssequence dependent setup timesmakespan of a set of jobsnear optimal schedules

Mathematics Subject Classification ID

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

Related Items (31)

An integer programming approach for the time-dependent TSP ⋮ Using genetic algorithm for dynamic and multiple criteria web-site optimizations ⋮ A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times ⋮ An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups ⋮ A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups ⋮ A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Dominance rules for single machine schedule with sequence dependent setup and due date ⋮ The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A memetic algorithm for the total tardiness single machine scheduling problem ⋮ Algorithmical approaches to business process design ⋮ A bicriteria scheduling with sequence-dependent setup times ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ Some dominance properties for single-machine tardiness problems with sequence-dependent setup ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic ⋮ Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The two-machine sequence dependent flowshop scheduling problem
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Minimizing Total Tardiness on One Machine is NP-Hard
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
• Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
• A Production Scheduling Problem with Sequencing Considerations
• Minimizing Total Costs in One-Machine Scheduling
• A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Minimum Change-Over Scheduling of Several Products on One Machine
• The Traveling Salesman Problem: A Survey

This page was built for publication: Scheduling in a sequence dependent setup environment with genetic search