Sequence-dependent group scheduling problem on unrelated-parallel machines

Authors:
Mir Abbas Bozorgirad;Rasaratnam Logendran
Affiliations:
School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR 97331-6001, USA;School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR 97331-6001, USA
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 11
Cited 2

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
An assembly scheduler for TFT LCD manufacturing

Computers and Industrial Engineering
An Agent-Based Approach for Scheduling Multiple Machines

Applied Intelligence
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
Single-machine group scheduling with a time-dependent learning effect

Computers and Operations Research
Scheduling unrelated parallel machines with sequence-dependent setups

Computers and Operations Research
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines

Theoretical Computer Science
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Computers and Operations Research
Total flow time minimization in a flowshop sequence-dependent group scheduling problem

Computers and Operations Research
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

Computers and Operations Research
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research

A multi-objective approach to the application of real-world production scheduling

Expert Systems with Applications: An International Journal
A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

Applied Soft Computing

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this research we address a sequence-dependent group scheduling problem on a set of unrelated-parallel machines where the run time of each job differs on different machines. To benefit both producer and customers we attempt to minimize a linear combination of total weighted completion time and total weighted tardiness. Since the problem is shown to be NP-hard, meta-heuristic algorithms based on tabu search are developed to find the optimal/near optimal solution. For some small size yet complex problems, the results from these algorithms are compared to the optimal solutions found by CPLEX. The result obtained in all of these problems is that the tabu search algorithms could find solutions at least as good as CPLEX but in drastically shorter computational time, thus signifying the high degree of efficiency and efficacy attained by the former.