Journal ArticleDOI
Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
Reads0
Chats0
TLDR
Four search heuristics are proposed to address the problem, namely the earliest weighted due date, the shortest weighted processing time, the two-level batch scheduling heuristic, and the simulated annealing method.Citations
More filters
Journal ArticleDOI
Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times
TL;DR: The fixed set search (FSS) algorithm as mentioned in this paper is a population-based metaheuristic of this type that adds a learning mechanism to the GRASP algorithm to avoid focusing on specific high quality solutions but on parts or elements that such solutions have.
Journal ArticleDOI
A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints
TL;DR: The paper presents a novel hybrid genetic algorithm for a deterministic scheduling problem where multiple jobs with arbitrary precedence constraints are processed on multiple unrelated parallel machines and gets better results than the conventional genetic algorithm within the same runtime for large-sized problems.
Journal ArticleDOI
Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm
Gerhard Rauchecker,Guido Schryen +1 more
TL;DR: This work adapts an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach and conducting extensive computational experiments.
Journal ArticleDOI
A multi-agent-based negotiation approach for parallel machine scheduling with multi-objectives in an electro-etching process
Ching-Jen Huang,Li-Man Liao +1 more
TL;DR: In this article, an agent-based negotiation approach is proposed to develop a distributed parallel machine scheduling application in this manufacturing environment, which consists of types of agent, i.e. job agents, machine agents and management agents, to represent jobs, machines and supervisors, respectively.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Scheduling with batching: A review
TL;DR: This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results about efficient dynamic programming algorithms for solving batching problems.
Journal ArticleDOI
A state-of-the-art review of parallel-machine scheduling research
T.C.E. Cheng,C.C.S. Sin +1 more
TL;DR: The major research results in deterministic parallel-machine scheduling theory will pass a survey and it is revealed that there exist a lot of potential areas worthy of further research.
Journal ArticleDOI
A decomposition algorithm for the single machine total tardiness problem
Chris N. Potts,L Van Wassenhove +1 more
TL;DR: The problem of sequencing jobs on a single machine to minimize total tardiness is considered and an algorithm, which decomposes the problem into subproblems which are then solved by dynamic programming when they are sufficiently small.
Journal ArticleDOI
Unrelated parallel machine scheduling with setup times using simulated annealing
TL;DR: Simulated annealing (SA), a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness, and shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardyness.