Scheduling in a sequence dependent setup environment with genetic search

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

Paul A. Rubin, Gary L. Ragatz

Publication date: 13 February 1995

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

zbMATH Keywords

genetic search; total tardiness; sequence dependent setup times; makespan of a set of jobs; near optimal schedules

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Some dominance properties for single-machine tardiness problems with sequence-dependent setup, A memetic algorithm for the total tardiness single machine scheduling problem, Algorithmical approaches to business process design, Using genetic algorithm for dynamic and multiple criteria web-site optimizations, 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, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times, Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure, Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic, 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 bicriteria scheduling with sequence-dependent setup times, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times

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