Journal ArticleDOI
Tabu search for a class of single-machine scheduling problems
TLDR
A tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure is developed and found to perform better than the simulated annealing approach for the variance minimization problem.About:
This article is published in Computers & Operations Research.The article was published on 2001-10-01. It has received 54 citations till now. The article focuses on the topics: Single-machine scheduling & Tabu search.read more
Citations
More filters
Journal ArticleDOI
A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
Fawaz S. Al-Anzi,Ali Allahverdi +1 more
TL;DR: This work addresses the two-stage assembly flowshop scheduling problem with respect to maximum lateness criterion where setup times are treated as separate from processing times, and proposes a self-adaptive differential evolution heuristic that performs as good as particle swarm optimization in terms of the average error.
Journal ArticleDOI
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date
Ching-Jong Liao,Che-Ching Cheng +1 more
TL;DR: This paper considers minimizing the total weighted earliness and tardiness with a restrictive common due date in a single machine environment, which has been proved as an NP-hard problem.
Journal ArticleDOI
Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
Ali Allahverdi,Fawaz S. Al-Anzi +1 more
TL;DR: This paper addresses the two-stage assembly flowshop scheduling problem with respect to the makespan criterion where setup times are considered as separate from processing times, and proposes two evolutionary heuristics: a Particle Swarm Optimization (PSO) and a Tabu search.
Journal ArticleDOI
Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method
Shijin Wang,Ming Liu +1 more
TL;DR: In this article, an integrated bi-objective optimisation problem with non-resumable jobs for production scheduling and preventive maintenance in a two-stage hybrid flow shop with one machine on the first stage and m identical parallel machines on the second stage is investigated.
Journal ArticleDOI
A state of the art review of intelligent scheduling
TL;DR: A survey of intelligent scheduling systems is provided by categorizing them into five major techniques containing fuzzy logic, expert systems, machine learning, stochastic local search optimization algorithms and constraint programming.
References
More filters
Journal ArticleDOI
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
Journal ArticleDOI
Future paths for integer programming and links to artificial intelligence
TL;DR: Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.
Journal ArticleDOI
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker,Gary D. Scudder +1 more
TL;DR: A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
Journal ArticleDOI
A Fast Taboo Search Algorithm for the Job Shop Problem
TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented, based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions.
Journal ArticleDOI
Some efficient heuristic methods for the flow shop sequencing problem
TL;DR: In this paper, the best heuristic methods known up to now are compared to solve the flow shop sequencing problem and they improve the complexity of the best one, and a parallel taboo search algorithm is presented and experimental results show that this heuristic allows very good speed-up.