An effective heuristic algorithm for the partial shop scheduling problem

DOI10.1016/j.cor.2018.01.015zbMath1391.90334OpenAlexW2793088185MaRDI QIDQ1652579

Marcus Ritt, Tadeu K. Zubaran

Publication date: 11 July 2018

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

Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.015

zbMATH Keywords

heuristicopen shop schedulingiterated tabu searchgroup shop schedulingmixed shop schedulingpartial shop scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

An effective heuristic algorithm for the partial shop scheduling problem ⋮ Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines

Uses Software

• irace
• Beam-ACO
• CPU Benchmarks

Cites Work

• Unnamed Item
• An ant colony optimization algorithm for shop 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
• The mixed shop scheduling problem
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Benchmarks for shop scheduling problems
• A tabu search algorithm for the open shop scheduling problem
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• Shop scheduling problems under precedence constraints
• A branch \(\&\) bound algorithm for the open-shop problem
• Competitive genetic algorithms for the open-shop scheduling problem
• Job-shop scheduling with processing alternatives.
• A hybrid genetic algorithm for the open shop scheduling problem
• An effective heuristic algorithm for the partial shop scheduling problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A new lower bound for the open-shop problem
• Complexity of mixed shop scheduling problems: A survey
• Benchmarks for basic scheduling problems
• A new particle swarm optimization for the open shop scheduling problem
• A fast tabu search algorithm for the group shop scheduling problem
• Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes
• Fifty years of scheduling: a survey of milestones
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• Evolutionary Multi-Criterion Optimization
• Solving the open shop scheduling problem
• The three-stage assembly flowshop scheduling problem

This page was built for publication: An effective heuristic algorithm for the partial shop scheduling problem