Genetic algorithms for a two-agent single-machine problem with release time

Authors:
Wen-Chiung Lee;Yu-Hsiang Chung;Mei-Chia Hu
Affiliations:
Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Industrial & Engineering Management, National Chiao Tung University, Hsinchu, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Applied Soft Computing
Year:
2012

Citing 25
Cited 1

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
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
Mixed Criteria Packet Scheduling

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Information Processing Letters
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications

Operations Research
A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance

Expert Systems with Applications: An International Journal
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem

Expert Systems with Applications: An International Journal
A two-machine flowshop problem with two agents

Computers and Operations Research
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
Forecasting stock markets using wavelet transforms and recurrent neural networks: An integrated system based on artificial bee colony algorithm

Applied Soft Computing
An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems

Applied Soft Computing
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Simplified multi-objective genetic algorithms for stochastic job shop scheduling

Applied Soft Computing
Parallel genetic algorithm in bus route headway optimization

Applied Soft Computing
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm

Applied Soft Computing
Two-agent scheduling with learning consideration

Computers and Industrial Engineering
Solving a two-agent single-machine scheduling problem considering learning effect

Computers and Operations Research
Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm

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

Information Sciences: an International Journal

A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling with two competing agents has drawn a lot of attention lately. However, it is assumed that all the jobs are available in the beginning in most of the research. In this paper, we study a single-machine problem in which jobs have different release times. The objective is to minimize the total tardiness of jobs from the first agent given that the maximum tardiness of jobs from the second agent does not exceed an upper bound. Three genetic algorithms are proposed to obtain the near-optimal solutions. Computational results show that the branch-and-bound algorithm could solve most of the problems with 16 jobs within a reasonable amount of time. In addition, it shows that the performance of the combined genetic algorithm is very good with mean error percentages of less than 0.2% for all the cases.