Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem

Authors:
Wen-Chiung Lee;Shiuan-kang Chen;Chin-Chia Wu
Affiliations:
Department of Statistics, Feng Chia University, 100 Wenhua Rd., Taichung, Taiwan;Department of Statistics, Feng Chia University, 100 Wenhua Rd., Taichung, Taiwan;Department of Statistics, Feng Chia University, 100 Wenhua Rd., Taichung, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 8
Cited 4

A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Scheduling Problems with Two Competing Agents

Operations Research
A note on the scheduling with two families of jobs

Journal of Scheduling
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

Theoretical Computer Science
A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem

Expert Systems with Applications: An International Journal
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Fuzzy and simulated annealing based dynamic programming for the unit commitment problem

Expert Systems with Applications: An International Journal
Improved orthogonal array based simulated annealing for design optimization

Expert Systems with Applications: An International Journal

Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
Genetic algorithms for a two-agent single-machine problem with release time

Applied Soft Computing
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

Computers and Operations Research
Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs

Computers and Operations Research

Quantified Score

Hi-index	12.05

Visualization

Abstract

We consider a two-agent scheduling problem on a two-machine flowshop setting, where the objective is to minimize the total tardiness of the first agent with the restriction that the number of tardy jobs of the second agent is zero. It is reported in the literature that the complexity of even two-machine flowshop problem, where both agents wish to complete their jobs as soon as possible, is shown NP-hard. Motivated by the limitation and suggestions, this paper proposes a branch-and-bound algorithm and a simulated annealing heuristic algorithm to search for the optimal solution and near-optimal solutions, respectively. Computational results are also presented to evaluate the performance of the proposed algorithms.